Base | Representation |
---|---|
bin | 1001001001101110101110… |
… | …01101111000100011101101 |
3 | 2122020222111222001101120120 |
4 | 10210313113031320203231 |
5 | 10114214042311211413 |
6 | 110445313023435153 |
7 | 4145010312612111 |
oct | 444672715704355 |
9 | 78228458041516 |
10 | 20125532522733 |
11 | 645a21048a3a0 |
12 | 2310568155ab9 |
13 | b2caa275b0a1 |
14 | 4d811c285741 |
15 | 24d7a08d2723 |
hex | 124dd73788ed |
20125532522733 has 16 divisors (see below), whose sum is σ = 29387406540096. Its totient is φ = 12149832151040.
The previous prime is 20125532522729. The next prime is 20125532522737. The reversal of 20125532522733 is 33722523552102.
It is an interprime number because it is at equal distance from previous prime (20125532522729) and next prime (20125532522737).
It is a cyclic number.
It is not a de Polignac number, because 20125532522733 - 22 = 20125532522729 is a prime.
It is a super-2 number, since 2×201255325227332 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20125532522737) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1186498566 + ... + 1186515527.
It is an arithmetic number, because the mean of its divisors is an integer number (1836712908756).
Almost surely, 220125532522733 is an apocalyptic number.
It is an amenable number.
20125532522733 is a deficient number, since it is larger than the sum of its proper divisors (9261874017363).
20125532522733 is a wasteful number, since it uses less digits than its factorization.
20125532522733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2373014364.
The product of its (nonzero) digits is 756000, while the sum is 42.
The spelling of 20125532522733 in words is "twenty trillion, one hundred twenty-five billion, five hundred thirty-two million, five hundred twenty-two thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •