Factorion

In number theory, a factorion in a given number base b is a natural number that equals the sum of the factorials of its digits. The name factorion was coined by the author Clifford A. Pickover.

Definition

Let n be a natural number. For a base b>1, we define the sum of the factorials of the digits of n, SFDb:ℕ→ℕ, to be the following:

SFDb(n)=∑i=0k−1di!.

where k=⌊logbn⌋+1 is the number of digits in the number in base b, n! is the factorial of n and

di=nmodbi+1−nmodbibi

is the value of the ith digit of the number. A natural number n is a b-factorion if it is a fixed point for SFDb, i.e. if SFDb(n)=n. 1 and 2 are fixed points for all bases b, and thus are trivial factorions for all b, and all other factorions are nontrivial factorions.

For example, the number 145 in base b=10 is a factorion because 145=1!+4!+5!.

For b=2, the sum of the factorials of the digits is simply the number of digits k in the base 2 representation since 0!=1!=1.

A natural number n is a sociable factorion if it is a periodic point for SFDb, where SFDbc(n)=n for a positive integer c, and forms a cycle of period c. A factorion is a sociable factorion with c=1, and a amicable factorion is a sociable factorion with c=2.

All natural numbers n are preperiodic points for SFDb, regardless of the base. This is because all natural numbers of base b with k digits satisfy bk−1≤n<bk. Given that each of the k digits is at most b−1, SFDb≤(b−1)!k. However, when k≥b, then bk−1>(b−1)!(k) for b>2, so any n will satisfy n>SFDb(n) until n<bb. There are finitely many natural numbers less than bb, so the number is guaranteed to reach a periodic point or a fixed point less than bb, making it a preperiodic point. For b=2, the number of digits k≤n for any number, once again, making it a preperiodic point. This means also that there are a finite number of factorions and cycles for any given base b.

The number of iterations i needed for SFDbi(n) to reach a fixed point is the SFDb function's persistence of n, and undefined if it never reaches a fixed point.

Factorions for SFDb

b = (m − 1)!

Let m be a positive integer and the number base b=(m−1)!. Then:

  • n1=mb+1 is a factorion for SFDb for all m≥4.
Proof

Let the digits of n1=d1b+d0 be d1=m, and d0=1. Then

SFDb(n1)=d1!+d0!
=m!+1!
=m(m−1)!+1
=d1b+d0
=n1

Thus n1 is a factorion for Fb for all k.

  • n2=mb+2 is a factorion for SFDb for all m≥4.
Proof

Let the digits of n2=d1b+d0 be d1=m, and d0=2. Then

SFDb(n2)=d1!+d0!
=m!+2!
=m(m−1)!+2
=d1b+d0
=n2

Thus n2 is a factorion for Fb for all k.

Factorions
m b n1 n2
464142
5245152
61206162
77207172

b = m! − m + 1

Let k be a positive integer and the number base b=m!−m+1. Then:

  • n1=b+m is a factorion for SFDb for all m≥3.
Proof

Let the digits of n1=d1b+d0 be d1=1, and d0=m. Then

SFDb(n1)=d1!+d0!
=1!+m!
=m!+1−m+m
=1(m!−m+1)+m
=d1b+d0
=n1

Thus n1 is a factorion for Fb for all m.

Factorions
m b n1
3413
42114
511615
671516

Table of factorions and cycles of SFDb

All numbers are represented in base b.

Base b Nontrivial factorion (n≠1, n≠2) Cycles
2∅∅
3∅∅
4133 → 12 → 3
5144∅
641, 42∅
7∅36 → 2055 → 465 → 2343 → 53 → 240 → 36
8∅

3 → 6 → 1320 → 12

175 → 12051 → 175

962558
10145, 40585

871 → 45361 → 871

872 → 45362 → 872

169 → 363601 → 1454 → 169

See also