Base | Representation |
---|---|
bin | 10110110010010001110011… |
… | …111000010110011010111011 |
3 | 111010211012000000120222212020 |
4 | 112302101303320112122323 |
5 | 101113333411000231021 |
6 | 553044451330045523 |
7 | 30052041531564132 |
oct | 2662216370263273 |
9 | 433735000528766 |
10 | 100212121102011 |
11 | 29a267a3923756 |
12 | b2a59447198a3 |
13 | 43bbc6871b319 |
14 | 1aa6414a36919 |
15 | b8bb31e367c6 |
hex | 5b2473e166bb |
100212121102011 has 8 divisors (see below), whose sum is σ = 133622378284560. Its totient is φ = 66804972327072.
The previous prime is 100212121101973. The next prime is 100212121102033. The reversal of 100212121102011 is 110201121212001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100212121102011 - 245 = 65027749013179 is a prime.
It is a super-2 number, since 2×1002121211020112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100212121102811) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 777026676 + ... + 777155633.
It is an arithmetic number, because the mean of its divisors is an integer number (16702797285570).
Almost surely, 2100212121102011 is an apocalyptic number.
100212121102011 is a deficient number, since it is larger than the sum of its proper divisors (33410257182549).
100212121102011 is a wasteful number, since it uses less digits than its factorization.
100212121102011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1554203805.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 100212121102011 its reverse (110201121212001), we get a palindrome (210413242314012).
The spelling of 100212121102011 in words is "one hundred trillion, two hundred twelve billion, one hundred twenty-one million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •