Base | Representation |
---|---|
bin | 110011001110100101… |
… | …010101001010011001 |
3 | 12020222102112220211212 |
4 | 303032211111022121 |
5 | 1400122402000212 |
6 | 41134050432505 |
7 | 3655042015244 |
oct | 631645251231 |
9 | 166872486755 |
10 | 55005500057 |
11 | 21367197362 |
12 | a7b1292735 |
13 | 5257aa5b91 |
14 | 293b42425b |
15 | 166e035e22 |
hex | cce955299 |
55005500057 has 8 divisors (see below), whose sum is σ = 55110055560. Its totient is φ = 54901008000.
The previous prime is 55005500051. The next prime is 55005500089. The reversal of 55005500057 is 75000550055.
55005500057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 200817241 + 54804682816 = 14171^2 + 234104^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 55005500057 - 216 = 55005434521 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55005499996 and 55005500032.
It is not an unprimeable number, because it can be changed into a prime (55005500051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1945619 + ... + 1973687.
It is an arithmetic number, because the mean of its divisors is an integer number (6888756945).
Almost surely, 255005500057 is an apocalyptic number.
It is an amenable number.
55005500057 is a deficient number, since it is larger than the sum of its proper divisors (104555503).
55005500057 is a wasteful number, since it uses less digits than its factorization.
55005500057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31723.
The product of its (nonzero) digits is 21875, while the sum is 32.
The spelling of 55005500057 in words is "fifty-five billion, five million, five hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •