Base | Representation |
---|---|
bin | 1001001101000111101111… |
… | …10111000010111110111111 |
3 | 2122200010020212111222202122 |
4 | 10212203313313002332333 |
5 | 10123121201320114442 |
6 | 111015022231313155 |
7 | 4156303504442426 |
oct | 446436767027677 |
9 | 78603225458678 |
10 | 20242044301247 |
11 | 64a466a33203a |
12 | 232b06381b7bb |
13 | b3aa80071072 |
14 | 4dda122182bd |
15 | 25181e505dd2 |
hex | 1268f7dc2fbf |
20242044301247 has 2 divisors, whose sum is σ = 20242044301248. Its totient is φ = 20242044301246.
The previous prime is 20242044301211. The next prime is 20242044301343. The reversal of 20242044301247 is 74210344024202.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20242044301247 - 212 = 20242044297151 is a prime.
It is a super-2 number, since 2×202420443012472 (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 (20242044304247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10121022150623 + 10121022150624.
It is an arithmetic number, because the mean of its divisors is an integer number (10121022150624).
Almost surely, 220242044301247 is an apocalyptic number.
20242044301247 is a deficient number, since it is larger than the sum of its proper divisors (1).
20242044301247 is an equidigital number, since it uses as much as digits as its factorization.
20242044301247 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86016, while the sum is 35.
Adding to 20242044301247 its reverse (74210344024202), we get a palindrome (94452388325449).
The spelling of 20242044301247 in words is "twenty trillion, two hundred forty-two billion, forty-four million, three hundred one thousand, two hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •