Base | Representation |
---|---|
bin | 101110110000100001… |
… | …0100010001010110000 |
3 | 100121011220110110021011 |
4 | 1131201002202022300 |
5 | 3121121022131000 |
6 | 114043452040304 |
7 | 10153211325103 |
oct | 1354102421260 |
9 | 317156413234 |
10 | 100412302000 |
11 | 3964814375a |
12 | 17563a63094 |
13 | 961306a61a |
14 | 4c07b0873a |
15 | 292a52d2ba |
hex | 17610a22b0 |
100412302000 has 320 divisors, whose sum is σ = 277989528960. Its totient is φ = 34836480000.
The previous prime is 100412301989. The next prime is 100412302009. The reversal of 100412302000 is 203214001.
It is not an unprimeable number, because it can be changed into a prime (100412302009) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 23899900 + ... + 23904100.
It is an arithmetic number, because the mean of its divisors is an integer number (868717278).
Almost surely, 2100412302000 is an apocalyptic number.
100412302000 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 100412302000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (138994764480).
100412302000 is an abundant number, since it is smaller than the sum of its proper divisors (177577226960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100412302000 is a wasteful number, since it uses less digits than its factorization.
100412302000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4297 (or 4281 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 100412302000 its reverse (203214001), we get a palindrome (100615516001).
The spelling of 100412302000 in words is "one hundred billion, four hundred twelve million, three hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •