Base | Representation |
---|---|
bin | 11000110110010000100101… |
… | …11001001111011111011101 |
3 | 21011110121200122012202110222 |
4 | 30123020102321033133131 |
5 | 24130214021034412021 |
6 | 312113402340211125 |
7 | 14336450133456041 |
oct | 1433102271173735 |
9 | 234417618182428 |
10 | 54640890935261 |
11 | 164570874a2124 |
12 | 616592b999aa5 |
13 | 24647c999cb97 |
14 | d6c8c1836021 |
15 | 64b5057aa6ab |
hex | 31b212e4f7dd |
54640890935261 has 2 divisors, whose sum is σ = 54640890935262. Its totient is φ = 54640890935260.
The previous prime is 54640890935177. The next prime is 54640890935269. The reversal of 54640890935261 is 16253909804645.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34823347079161 + 19817543856100 = 5901131^2 + 4451690^2 .
It is a cyclic number.
It is not a de Polignac number, because 54640890935261 - 210 = 54640890934237 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 54640890935194 and 54640890935203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (54640890935269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27320445467630 + 27320445467631.
It is an arithmetic number, because the mean of its divisors is an integer number (27320445467631).
Almost surely, 254640890935261 is an apocalyptic number.
It is an amenable number.
54640890935261 is a deficient number, since it is larger than the sum of its proper divisors (1).
54640890935261 is an equidigital number, since it uses as much as digits as its factorization.
54640890935261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 55987200, while the sum is 62.
The spelling of 54640890935261 in words is "fifty-four trillion, six hundred forty billion, eight hundred ninety million, nine hundred thirty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •