Base | Representation |
---|---|
bin | 10010101110011010… |
… | …00110011010000100 |
3 | 221221121110121221100 |
4 | 21113031012122010 |
5 | 131042031032000 |
6 | 4341314220100 |
7 | 504056655354 |
oct | 112715063204 |
9 | 27847417840 |
10 | 10052986500 |
11 | 4299715607 |
12 | 1b46884630 |
13 | c4298002b |
14 | 6b51d6b64 |
15 | 3dc877a00 |
hex | 257346684 |
10052986500 has 144 divisors (see below), whose sum is σ = 31767240960. Its totient is φ = 2676283200.
The previous prime is 10052986457. The next prime is 10052986571. The reversal of 10052986500 is 568925001.
It is a happy number.
10052986500 is a `hidden beast` number, since 1 + 0 + 0 + 529 + 86 + 50 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3323989 + ... + 3327011.
It is an arithmetic number, because the mean of its divisors is an integer number (220605840).
Almost surely, 210052986500 is an apocalyptic number.
10052986500 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 10052986500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15883620480).
10052986500 is an abundant number, since it is smaller than the sum of its proper divisors (21714254460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10052986500 is a wasteful number, since it uses less digits than its factorization.
10052986500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3787 (or 3772 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
The spelling of 10052986500 in words is "ten billion, fifty-two million, nine hundred eighty-six thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •