Base | Representation |
---|---|
bin | 11001001110000000001011… |
… | …10011110101011010010101 |
3 | 21021100121110211111110000100 |
4 | 30213000011303311122111 |
5 | 24232100323042401044 |
6 | 313540244021404313 |
7 | 14452421046345114 |
oct | 1447000563653225 |
9 | 237317424443010 |
10 | 55456715200149 |
11 | 16741073a8228a |
12 | 6277a71869699 |
13 | 24c3713192bb3 |
14 | d9a195665c7b |
15 | 662852e2d869 |
hex | 327005cf5695 |
55456715200149 has 24 divisors (see below), whose sum is σ = 82689286394624. Its totient is φ = 35778033720000.
The previous prime is 55456715200057. The next prime is 55456715200171. The reversal of 55456715200149 is 94100251765455.
55456715200149 is a `hidden beast` number, since 5 + 5 + 4 + 5 + 6 + 71 + 520 + 0 + 1 + 49 = 666.
It is not a de Polignac number, because 55456715200149 - 27 = 55456715200021 is a prime.
It is a super-2 number, since 2×554567152001492 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55456715200095 and 55456715200104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55456715240149) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19520049 + ... + 22179849.
Almost surely, 255456715200149 is an apocalyptic number.
It is an amenable number.
55456715200149 is a deficient number, since it is larger than the sum of its proper divisors (27232571194475).
55456715200149 is a wasteful number, since it uses less digits than its factorization.
55456715200149 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2734569 (or 2734566 counting only the distinct ones).
The product of its (nonzero) digits is 7560000, while the sum is 54.
The spelling of 55456715200149 in words is "fifty-five trillion, four hundred fifty-six billion, seven hundred fifteen million, two hundred thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •