Base | Representation |
---|---|
bin | 110011101100100000… |
… | …101111001011110000 |
3 | 12022021102100212111022 |
4 | 303230200233023300 |
5 | 1402134422044100 |
6 | 41255544435012 |
7 | 4003346630522 |
oct | 635440571360 |
9 | 168242325438 |
10 | 55507612400 |
11 | 215a4666839 |
12 | a911478a68 |
13 | 5307b1a586 |
14 | 2987da9a12 |
15 | 169d169e85 |
hex | cec82f2f0 |
55507612400 has 120 divisors (see below), whose sum is σ = 138360936000. Its totient is φ = 21374438400.
The previous prime is 55507612393. The next prime is 55507612411. The reversal of 55507612400 is 421670555.
55507612400 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4041545 + ... + 4055255.
It is an arithmetic number, because the mean of its divisors is an integer number (1153007800).
Almost surely, 255507612400 is an apocalyptic number.
55507612400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55507612400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69180468000).
55507612400 is an abundant number, since it is smaller than the sum of its proper divisors (82853323600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55507612400 is a wasteful number, since it uses less digits than its factorization.
55507612400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14107 (or 14096 counting only the distinct ones).
The product of its (nonzero) digits is 42000, while the sum is 35.
The spelling of 55507612400 in words is "fifty-five billion, five hundred seven million, six hundred twelve thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.173 sec. • engine limits •