Base | Representation |
---|---|
bin | 10011101001111101… |
… | …10010010000000000 |
3 | 1000020102111002210000 |
4 | 21310332302100000 |
5 | 133102423103100 |
6 | 4503041440000 |
7 | 522334125030 |
oct | 116476622000 |
9 | 30212432700 |
10 | 10552550400 |
11 | 4525704337 |
12 | 2066040000 |
13 | cc2311782 |
14 | 7216b78c0 |
15 | 41b656900 |
hex | 274fb2400 |
10552550400 has 660 divisors, whose sum is σ = 44718401728. Its totient is φ = 2408693760.
The previous prime is 10552550341. The next prime is 10552550419. The reversal of 10552550400 is 405525501.
10552550400 is a `hidden beast` number, since 1 + 0 + 5 + 5 + 255 + 0 + 400 = 666.
It is a super-2 number, since 2×105525504002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 14514837 + ... + 14515563.
Almost surely, 210552550400 is an apocalyptic number.
10552550400 is a gapful number since it is divisible by the number (10) 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 10552550400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22359200864).
10552550400 is an abundant number, since it is smaller than the sum of its proper divisors (34165851328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10552550400 is an equidigital number, since it uses as much as digits as its factorization.
10552550400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 776 (or 744 counting only the distinct ones).
The product of its (nonzero) digits is 5000, while the sum is 27.
The spelling of 10552550400 in words is "ten billion, five hundred fifty-two million, five hundred fifty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •