Base | Representation |
---|---|
bin | 10111000000110101001101… |
… | …110100101111100100100011 |
3 | 111021100210101221022000111021 |
4 | 113000311031310233210203 |
5 | 101231230101230032321 |
6 | 555132125234030311 |
7 | 30214224626145340 |
oct | 2700651564574443 |
9 | 437323357260437 |
10 | 101212210002211 |
11 | 2a281947a49690 |
12 | b427730418397 |
13 | 4462369242319 |
14 | 1adc9a8bc17c7 |
15 | ba7b663ad941 |
hex | 5c0d4dd2f923 |
101212210002211 has 64 divisors (see below), whose sum is σ = 135494905835520. Its totient is φ = 73226998373760.
The previous prime is 101212210002209. The next prime is 101212210002223. The reversal of 101212210002211 is 112200012212101.
It is not a de Polignac number, because 101212210002211 - 21 = 101212210002209 is a prime.
It is a super-2 number, since 2×1012122100022112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101212210002251) 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, 16689436 + ... + 21930838.
It is an arithmetic number, because the mean of its divisors is an integer number (2117107903680).
Almost surely, 2101212210002211 is an apocalyptic number.
101212210002211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
101212210002211 is a deficient number, since it is larger than the sum of its proper divisors (34282695833309).
101212210002211 is a wasteful number, since it uses less digits than its factorization.
101212210002211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5241704.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 101212210002211 its reverse (112200012212101), we get a palindrome (213412222214312).
The spelling of 101212210002211 in words is "one hundred one trillion, two hundred twelve billion, two hundred ten million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •