Base | Representation |
---|---|
bin | 100000001010001111100… |
… | …100111011000101001011 |
3 | 21211021110020022110021220 |
4 | 200022033210323011023 |
5 | 242202111113324321 |
6 | 4411134201333123 |
7 | 315445256100450 |
oct | 40121744730513 |
9 | 7737406273256 |
10 | 2210022011211 |
11 | 7822a08a0383 |
12 | 2b8397a971a3 |
13 | 130533ca96a1 |
14 | 78d739c3827 |
15 | 3c74b20b9c6 |
hex | 2028f93b14b |
2210022011211 has 16 divisors (see below), whose sum is σ = 3483778540800. Its totient is φ = 1219322488608.
The previous prime is 2210022011191. The next prime is 2210022011291. The reversal of 2210022011211 is 1121102200122.
It is not a de Polignac number, because 2210022011211 - 215 = 2210021978443 is a prime.
It is a super-2 number, since 2×22100220112112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2210022011291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1814467381 + ... + 1814468598.
It is an arithmetic number, because the mean of its divisors is an integer number (217736158800).
Almost surely, 22210022011211 is an apocalyptic number.
2210022011211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2210022011211 is a deficient number, since it is larger than the sum of its proper divisors (1273756529589).
2210022011211 is a wasteful number, since it uses less digits than its factorization.
2210022011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3628936018.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2210022011211 its reverse (1121102200122), we get a palindrome (3331124211333).
The spelling of 2210022011211 in words is "two trillion, two hundred ten billion, twenty-two million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •