Base | Representation |
---|---|
bin | 11000101111110101101000… |
… | …01010101000101000011011 |
3 | 21010200112012101000222102201 |
4 | 30113322310022220220123 |
5 | 24113110142112431232 |
6 | 311424153241511031 |
7 | 14314506506315263 |
oct | 1427726412505033 |
9 | 233615171028381 |
10 | 54420258327067 |
11 | 16381558102016 |
12 | 612b0164a2477 |
13 | 2449a67c01309 |
14 | d61d514387a3 |
15 | 6458e0caabe7 |
hex | 317eb42a8a1b |
54420258327067 has 2 divisors, whose sum is σ = 54420258327068. Its totient is φ = 54420258327066.
The previous prime is 54420258327031. The next prime is 54420258327073. The reversal of 54420258327067 is 76072385202445.
It is a happy number.
54420258327067 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 is a cyclic number.
It is not a de Polignac number, because 54420258327067 - 235 = 54385898588699 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 54420258326999 and 54420258327017.
It is not a weakly prime, because it can be changed into another prime (54420258327467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27210129163533 + 27210129163534.
It is an arithmetic number, because the mean of its divisors is an integer number (27210129163534).
Almost surely, 254420258327067 is an apocalyptic number.
54420258327067 is a deficient number, since it is larger than the sum of its proper divisors (1).
54420258327067 is an equidigital number, since it uses as much as digits as its factorization.
54420258327067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22579200, while the sum is 55.
The spelling of 54420258327067 in words is "fifty-four trillion, four hundred twenty billion, two hundred fifty-eight million, three hundred twenty-seven thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •