Base | Representation |
---|---|
bin | 1100110001111111101101… |
… | …0100110010000100100001 |
3 | 1211202110101112102120021212 |
4 | 3030133323110302010201 |
5 | 3320221123431220101 |
6 | 45515514550155505 |
7 | 2650204535542532 |
oct | 314377324620441 |
9 | 54673345376255 |
10 | 14053054554401 |
11 | 4528959a2a665 |
12 | 16ab6ab652b95 |
13 | 7ac2747995c5 |
14 | 368258726689 |
15 | 195843a111bb |
hex | cc7fb532121 |
14053054554401 has 2 divisors, whose sum is σ = 14053054554402. Its totient is φ = 14053054554400.
The previous prime is 14053054554359. The next prime is 14053054554431. The reversal of 14053054554401 is 10445545035041.
14053054554401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13650179998225 + 402874556176 = 3694615^2 + 634724^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14053054554401 is a prime.
It is not a weakly prime, because it can be changed into another prime (14053054554431) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7026527277200 + 7026527277201.
It is an arithmetic number, because the mean of its divisors is an integer number (7026527277201).
Almost surely, 214053054554401 is an apocalyptic number.
It is an amenable number.
14053054554401 is a deficient number, since it is larger than the sum of its proper divisors (1).
14053054554401 is an equidigital number, since it uses as much as digits as its factorization.
14053054554401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 480000, while the sum is 41.
Adding to 14053054554401 its reverse (10445545035041), we get a palindrome (24498599589442).
The spelling of 14053054554401 in words is "fourteen trillion, fifty-three billion, fifty-four million, five hundred fifty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •