Base | Representation |
---|---|
bin | 110000000001101001111101… |
… | …101010111110100100001010 |
3 | 1000200212102202200002212121011 |
4 | 300001221331222332210022 |
5 | 210141112040041213002 |
6 | 2025121044425034134 |
7 | 62330066516512060 |
oct | 6001517552764412 |
9 | 1020772680085534 |
10 | 211220010101002 |
11 | 613349a3231511 |
12 | 1b833a2a02594a |
13 | 90b1c66505546 |
14 | 3a23162a32030 |
15 | 19644b57818d7 |
hex | c01a7dabe90a |
211220010101002 has 16 divisors (see below), whose sum is σ = 362148820693632. Its totient is φ = 90508517770320.
The previous prime is 211220010100997. The next prime is 211220010101003. The reversal of 211220010101002 is 200101010022112.
It is a super-2 number, since 2×2112200101010022 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (211220010101003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1195216953 + ... + 1195393660.
It is an arithmetic number, because the mean of its divisors is an integer number (22634301293352).
Almost surely, 2211220010101002 is an apocalyptic number.
211220010101002 is a deficient number, since it is larger than the sum of its proper divisors (150928810592630).
211220010101002 is a wasteful number, since it uses less digits than its factorization.
211220010101002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2390616933.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 211220010101002 its reverse (200101010022112), we get a palindrome (411321020123114).
It can be divided in two parts, 2112 and 20010101002, that multiplied together give a palindrome (42261333316224).
The spelling of 211220010101002 in words is "two hundred eleven trillion, two hundred twenty billion, ten million, one hundred one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •