Base | Representation |
---|---|
bin | 1001001100100000111011… |
… | …00101001100101101110111 |
3 | 2122121010110100122122201102 |
4 | 10212100131211030231313 |
5 | 10122301010243221442 |
6 | 111001254143320315 |
7 | 4154635146513425 |
oct | 446203545145567 |
9 | 78533410578642 |
10 | 20221202320247 |
11 | 64968445a9255 |
12 | 23270078b009b |
13 | b38b0b105126 |
14 | 4dc9d619a115 |
15 | 250eee8be232 |
hex | 12641d94cb77 |
20221202320247 has 2 divisors, whose sum is σ = 20221202320248. Its totient is φ = 20221202320246.
The previous prime is 20221202320177. The next prime is 20221202320321. The reversal of 20221202320247 is 74202320212202.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20221202320247 - 210 = 20221202319223 is a prime.
It is a super-2 number, since 2×202212023202472 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20221202322247) 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 as a sum of consecutive naturals, namely, 10110601160123 + 10110601160124.
It is an arithmetic number, because the mean of its divisors is an integer number (10110601160124).
Almost surely, 220221202320247 is an apocalyptic number.
20221202320247 is a deficient number, since it is larger than the sum of its proper divisors (1).
20221202320247 is an equidigital number, since it uses as much as digits as its factorization.
20221202320247 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10752, while the sum is 29.
Adding to 20221202320247 its reverse (74202320212202), we get a palindrome (94423522532449).
The spelling of 20221202320247 in words is "twenty trillion, two hundred twenty-one billion, two hundred two million, three hundred twenty thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •