Base | Representation |
---|---|
bin | 1001000110001001000010… |
… | …01110101111111111110011 |
3 | 2121211012020010011222020122 |
4 | 10203010201032233333303 |
5 | 10110204021333242321 |
6 | 110312520525000455 |
7 | 4133053443352526 |
oct | 443044116577763 |
9 | 77735203158218 |
10 | 20002220212211 |
11 | 6411991942366 |
12 | 22b06930b312b |
13 | b21280271283 |
14 | 4d218107abbd |
15 | 24a484c468ab |
hex | 1231213afff3 |
20002220212211 has 4 divisors (see below), whose sum is σ = 20871881960592. Its totient is φ = 19132558463832.
The previous prime is 20002220212193. The next prime is 20002220212223. The reversal of 20002220212211 is 11221202220002.
It is a happy number.
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 20002220212211 - 226 = 20002153103347 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 20002220212211.
It is not an unprimeable number, because it can be changed into a prime (20002220212111) 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, 434830874156 + ... + 434830874201.
It is an arithmetic number, because the mean of its divisors is an integer number (5217970490148).
Almost surely, 220002220212211 is an apocalyptic number.
20002220212211 is a deficient number, since it is larger than the sum of its proper divisors (869661748381).
20002220212211 is an equidigital number, since it uses as much as digits as its factorization.
20002220212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 869661748380.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 20002220212211 its reverse (11221202220002), we get a palindrome (31223422432213).
The spelling of 20002220212211 in words is "twenty trillion, two billion, two hundred twenty million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •