Base | Representation |
---|---|
bin | 1001000110110001101010… |
… | …00010010001111010010101 |
3 | 2121220021111220010000220121 |
4 | 10203120311002101322111 |
5 | 10111033201443332203 |
6 | 110330524451031541 |
7 | 4134455030634214 |
oct | 443306502217225 |
9 | 77807456100817 |
10 | 20024027324053 |
11 | 6420162443245 |
12 | 22b495a29b5b1 |
13 | b2334715904c |
14 | 4d324d36b07b |
15 | 24ad0e4730bd |
hex | 123635091e95 |
20024027324053 has 2 divisors, whose sum is σ = 20024027324054. Its totient is φ = 20024027324052.
The previous prime is 20024027324023. The next prime is 20024027324071. The reversal of 20024027324053 is 35042372042002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15859844283364 + 4164183040689 = 3982442^2 + 2040633^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20024027324053 is a prime.
It is a super-2 number, since 2×200240273240532 (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 (20024027324023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10012013662026 + 10012013662027.
It is an arithmetic number, because the mean of its divisors is an integer number (10012013662027).
Almost surely, 220024027324053 is an apocalyptic number.
It is an amenable number.
20024027324053 is a deficient number, since it is larger than the sum of its proper divisors (1).
20024027324053 is an equidigital number, since it uses as much as digits as its factorization.
20024027324053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 80640, while the sum is 34.
Adding to 20024027324053 its reverse (35042372042002), we get a palindrome (55066399366055).
The spelling of 20024027324053 in words is "twenty trillion, twenty-four billion, twenty-seven million, three hundred twenty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •