Base | Representation |
---|---|
bin | 10110110010010001111001… |
… | …010011000110110110100011 |
3 | 111010211012020100122012111022 |
4 | 112302101321103012312203 |
5 | 101113334102233032321 |
6 | 553044504334240055 |
7 | 30052044014326241 |
oct | 2662217123066643 |
9 | 433735210565438 |
10 | 100212212002211 |
11 | 29a2684016a391 |
12 | b2a596b05602b |
13 | 43bbc814c6c1a |
14 | 1aa6422b39791 |
15 | b8bb39ddedab |
hex | 5b24794c6da3 |
100212212002211 has 4 divisors (see below), whose sum is σ = 100212867749592. Its totient is φ = 100211556254832.
The previous prime is 100212212002121. The next prime is 100212212002219. The reversal of 100212212002211 is 112200212212001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100212212002211 - 226 = 100212144893347 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 100212212002211.
It is not an unprimeable number, because it can be changed into a prime (100212212002219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 327644405 + ... + 327950118.
It is an arithmetic number, because the mean of its divisors is an integer number (25053216937398).
Almost surely, 2100212212002211 is an apocalyptic number.
100212212002211 is a deficient number, since it is larger than the sum of its proper divisors (655747381).
100212212002211 is an equidigital number, since it uses as much as digits as its factorization.
100212212002211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 655747380.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 100212212002211 its reverse (112200212212001), we get a palindrome (212412424214212).
The spelling of 100212212002211 in words is "one hundred trillion, two hundred twelve billion, two hundred twelve million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •