Base | Representation |
---|---|
bin | 101110100100100101… |
… | …1111110010001000000 |
3 | 100120011000110021011010 |
4 | 1131021023332101000 |
5 | 3114311100420300 |
6 | 113540034520520 |
7 | 10140252010053 |
oct | 1351113762100 |
9 | 316130407133 |
10 | 100012123200 |
11 | 39462266480 |
12 | 17471a36140 |
13 | 957b195832 |
14 | 4baa8d8a9a |
15 | 2905331a50 |
hex | 17492fe440 |
100012123200 has 336 divisors, whose sum is σ = 358486716096. Its totient is φ = 24209203200.
The previous prime is 100012123199. The next prime is 100012123217. The reversal of 100012123200 is 2321210001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 57709534 + ... + 57711266.
Almost surely, 2100012123200 is an apocalyptic number.
100012123200 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 100012123200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (179243358048).
100012123200 is an abundant number, since it is smaller than the sum of its proper divisors (258474592896).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100012123200 is a wasteful number, since it uses less digits than its factorization.
100012123200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2862 (or 2847 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 100012123200 its reverse (2321210001), we get a palindrome (102333333201).
The spelling of 100012123200 in words is "one hundred billion, twelve million, one hundred twenty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •