Base | Representation |
---|---|
bin | 10011100100010000… |
… | …01000110011000000 |
3 | 1000010002101112202200 |
4 | 21302020020303000 |
5 | 133003143423100 |
6 | 4454211313200 |
7 | 521213140140 |
oct | 116210106300 |
9 | 30102345680 |
10 | 10504670400 |
11 | 4500681394 |
12 | 2051bab800 |
13 | cb5419303 |
14 | 7191b2920 |
15 | 417349e00 |
hex | 272208cc0 |
10504670400 has 756 divisors, whose sum is σ = 44832099312. Its totient is φ = 2285015040.
The previous prime is 10504670389. The next prime is 10504670401. The reversal of 10504670400 is 407640501.
It is a super-2 number, since 2×105046704002 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10504670401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 53323102 + ... + 53323298.
Almost surely, 210504670400 is an apocalyptic number.
10504670400 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 10504670400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22416049656).
10504670400 is an abundant number, since it is smaller than the sum of its proper divisors (34327428912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10504670400 is a wasteful number, since it uses less digits than its factorization.
10504670400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278 (or 237 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The spelling of 10504670400 in words is "ten billion, five hundred four million, six hundred seventy thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •