Base | Representation |
---|---|
bin | 110011111000100110… |
… | …000010010110111001 |
3 | 12022210112210220100201 |
4 | 303320212002112321 |
5 | 1403043321000444 |
6 | 41332025402201 |
7 | 4011360656032 |
oct | 637046022671 |
9 | 168715726321 |
10 | 55710328249 |
11 | 216990341a4 |
12 | a969339361 |
13 | 533ab15a94 |
14 | 29a6c97a89 |
15 | 16b0d5ddd4 |
hex | cf89825b9 |
55710328249 has 8 divisors (see below), whose sum is σ = 55943788320. Its totient is φ = 55476960000.
The previous prime is 55710328217. The next prime is 55710328259. The reversal of 55710328249 is 94282301755.
55710328249 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 55710328249 - 25 = 55710328217 is a prime.
It is a super-2 number, since 2×557103282492 (a number of 22 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 = 55710328199 and 55710328208.
It is not an unprimeable number, because it can be changed into a prime (55710328259) 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, 1368217 + ... + 1408345.
It is an arithmetic number, because the mean of its divisors is an integer number (6992973540).
Almost surely, 255710328249 is an apocalyptic number.
It is an amenable number.
55710328249 is a deficient number, since it is larger than the sum of its proper divisors (233460071).
55710328249 is a wasteful number, since it uses less digits than its factorization.
55710328249 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45911.
The product of its (nonzero) digits is 604800, while the sum is 46.
The spelling of 55710328249 in words is "fifty-five billion, seven hundred ten million, three hundred twenty-eight thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •