Base | Representation |
---|---|
bin | 110010101010110011… |
… | …001001011010001101 |
3 | 12012102120212120122002 |
4 | 302222303021122031 |
5 | 1342410204022112 |
6 | 40554323002045 |
7 | 3634132035542 |
oct | 625263113215 |
9 | 165376776562 |
10 | 54405142157 |
11 | 21089314603 |
12 | a664209325 |
13 | 51905b3412 |
14 | 28c17c6bc9 |
15 | 16364971c2 |
hex | caacc968d |
54405142157 has 2 divisors, whose sum is σ = 54405142158. Its totient is φ = 54405142156.
The previous prime is 54405142117. The next prime is 54405142193. The reversal of 54405142157 is 75124150445.
54405142157 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., 46429044676 + 7976097481 = 215474^2 + 89309^2 .
It is a cyclic number.
It is not a de Polignac number, because 54405142157 - 26 = 54405142093 is a prime.
It is a super-2 number, since 2×544051421572 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 54405142157.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (54405142117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27202571078 + 27202571079.
It is an arithmetic number, because the mean of its divisors is an integer number (27202571079).
Almost surely, 254405142157 is an apocalyptic number.
It is an amenable number.
54405142157 is a deficient number, since it is larger than the sum of its proper divisors (1).
54405142157 is an equidigital number, since it uses as much as digits as its factorization.
54405142157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112000, while the sum is 38.
The spelling of 54405142157 in words is "fifty-four billion, four hundred five million, one hundred forty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •