Base | Representation |
---|---|
bin | 10110110000110100110001… |
… | …010100101100010000011000 |
3 | 111010110122010202102212111012 |
4 | 112300310301110230100120 |
5 | 101110214311333211300 |
6 | 552530530303153052 |
7 | 30041604100164602 |
oct | 2660646124542030 |
9 | 433418122385435 |
10 | 100112220210200 |
11 | 29998399430050 |
12 | b28a503ba5788 |
13 | 43b27075cc4a3 |
14 | 1aa1658c14172 |
15 | b89236777435 |
hex | 5b0d3152c418 |
100112220210200 has 96 divisors (see below), whose sum is σ = 257135185152000. Its totient is φ = 35943627907200.
The previous prime is 100112220210199. The next prime is 100112220210271. The reversal of 100112220210200 is 2012022211001.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 287836040 + ... + 288183639.
It is an arithmetic number, because the mean of its divisors is an integer number (2678491512000).
Almost surely, 2100112220210200 is an apocalyptic number.
100112220210200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100112220210200 is an abundant number, since it is smaller than the sum of its proper divisors (157022964941800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100112220210200 is a wasteful number, since it uses less digits than its factorization.
100112220210200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576019785 (or 576019776 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 100112220210200 its reverse (2012022211001), we get a palindrome (102124242421201).
The spelling of 100112220210200 in words is "one hundred trillion, one hundred twelve billion, two hundred twenty million, two hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.475 sec. • engine limits •