Base | Representation |
---|---|
bin | 10011000001011011… |
… | …10001000111101000 |
3 | 222100201201001001102 |
4 | 21200231301013220 |
5 | 131403402420000 |
6 | 4405214140532 |
7 | 511035125450 |
oct | 114055610750 |
9 | 28321631042 |
10 | 10212545000 |
11 | 4370796239 |
12 | 1b901b1748 |
13 | c69a47848 |
14 | 6cc48cd60 |
15 | 3eb8943d5 |
hex | 260b711e8 |
10212545000 has 160 divisors (see below), whose sum is σ = 27450213120. Its totient is φ = 3488160000.
The previous prime is 10212544999. The next prime is 10212545017. The reversal of 10212545000 is 54521201.
It is a super-3 number, since 3×102125450003 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 15084662 + ... + 15085338.
It is an arithmetic number, because the mean of its divisors is an integer number (171563832).
Almost surely, 210212545000 is an apocalyptic number.
10212545000 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 10212545000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13725106560).
10212545000 is an abundant number, since it is smaller than the sum of its proper divisors (17237668120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10212545000 is an equidigital number, since it uses as much as digits as its factorization.
10212545000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1141 (or 1122 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 20.
The spelling of 10212545000 in words is "ten billion, two hundred twelve million, five hundred forty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •