Base | Representation |
---|---|
bin | 1001000110101100011011… |
… | …01110000010000010111001 |
3 | 2121220000021021001102121001 |
4 | 10203112031232002002321 |
5 | 10111011424334033423 |
6 | 110325342133045001 |
7 | 4134325333643506 |
oct | 443261556020271 |
9 | 77800237042531 |
10 | 20021220221113 |
11 | 6419a51954261 |
12 | 22b42b6186761 |
13 | b22cba712aa7 |
14 | 4d30646184ad |
15 | 24abe7cd3cad |
hex | 12358db820b9 |
20021220221113 has 2 divisors, whose sum is σ = 20021220221114. Its totient is φ = 20021220221112.
The previous prime is 20021220221059. The next prime is 20021220221263. The reversal of 20021220221113 is 31112202212002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19223419340304 + 797800880809 = 4384452^2 + 893197^2 .
It is a cyclic number.
It is not a de Polignac number, because 20021220221113 - 29 = 20021220220601 is a prime.
It is a super-2 number, since 2×200212202211132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20021220251113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010610110556 + 10010610110557.
It is an arithmetic number, because the mean of its divisors is an integer number (10010610110557).
Almost surely, 220021220221113 is an apocalyptic number.
It is an amenable number.
20021220221113 is a deficient number, since it is larger than the sum of its proper divisors (1).
20021220221113 is an equidigital number, since it uses as much as digits as its factorization.
20021220221113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 20021220221113 its reverse (31112202212002), we get a palindrome (51133422433115).
The spelling of 20021220221113 in words is "twenty trillion, twenty-one billion, two hundred twenty million, two hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •