Base | Representation |
---|---|
bin | 10110110010010001110010… |
… | …110000010010100110101010 |
3 | 111010211011221201001021122120 |
4 | 112302101302300102212222 |
5 | 101113333341131241020 |
6 | 553044445413132110 |
7 | 30052041212200215 |
oct | 2662216260224652 |
9 | 433734851037576 |
10 | 100212102212010 |
11 | 29a267941a1388 |
12 | b2a593a32a036 |
13 | 43bbc648361c9 |
14 | 1aa641231a77c |
15 | b8bb30454740 |
hex | 5b2472c129aa |
100212102212010 has 64 divisors (see below), whose sum is σ = 240926188793472. Its totient is φ = 26676918050816.
The previous prime is 100212102212009. The next prime is 100212102212071. The reversal of 100212102212010 is 10212201212001.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 38800429 + ... + 41302511.
It is an arithmetic number, because the mean of its divisors is an integer number (3764471699898).
Almost surely, 2100212102212010 is an apocalyptic number.
100212102212010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100212102212010 is an abundant number, since it is smaller than the sum of its proper divisors (140714086581462).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100212102212010 is a wasteful number, since it uses less digits than its factorization.
100212102212010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2504407.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 100212102212010 its reverse (10212201212001), we get a palindrome (110424303424011).
The spelling of 100212102212010 in words is "one hundred trillion, two hundred twelve billion, one hundred two million, two hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •