Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …10000000001111010100111 |
3 | 2121220002210200211201212011 |
4 | 10203113020100001322213 |
5 | 10111020432231241012 |
6 | 110330023412335051 |
7 | 4134361556506642 |
oct | 443271020017247 |
9 | 77802720751764 |
10 | 20022202212007 |
11 | 641a406197586 |
12 | 22b452b014487 |
13 | b23115cb5aa8 |
14 | 4d3118bd8a59 |
15 | 24ac541091a7 |
hex | 1235c8401ea7 |
20022202212007 has 2 divisors, whose sum is σ = 20022202212008. Its totient is φ = 20022202212006.
The previous prime is 20022202211993. The next prime is 20022202212029. The reversal of 20022202212007 is 70021220222002.
It is an a-pointer prime, because the next prime (20022202212029) can be obtained adding 20022202212007 to its sum of digits (22).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20022202212007 - 211 = 20022202209959 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20022202212407) 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 as a sum of consecutive naturals, namely, 10011101106003 + 10011101106004.
It is an arithmetic number, because the mean of its divisors is an integer number (10011101106004).
Almost surely, 220022202212007 is an apocalyptic number.
20022202212007 is a deficient number, since it is larger than the sum of its proper divisors (1).
20022202212007 is an equidigital number, since it uses as much as digits as its factorization.
20022202212007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 896, while the sum is 22.
Adding to 20022202212007 its reverse (70021220222002), we get a palindrome (90043422434009).
The spelling of 20022202212007 in words is "twenty trillion, twenty-two billion, two hundred two million, two hundred twelve thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •