Base | Representation |
---|---|
bin | 1001000111000000100001… |
… | …11111100000110110110101 |
3 | 2121221001010101201201122001 |
4 | 10203200100333200312311 |
5 | 10111201030203204103 |
6 | 110334325102135301 |
7 | 4135156642156042 |
oct | 443402077406665 |
9 | 77831111651561 |
10 | 20032012553653 |
11 | 642358a942451 |
12 | 22b6408581531 |
13 | b2401a5ca189 |
14 | 4d37a9aac1c9 |
15 | 24b12a50201d |
hex | 123810fe0db5 |
20032012553653 has 2 divisors, whose sum is σ = 20032012553654. Its totient is φ = 20032012553652.
The previous prime is 20032012553611. The next prime is 20032012553671. The reversal of 20032012553653 is 35635521023002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19754486938404 + 277525615249 = 4444602^2 + 526807^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20032012553653 is a prime.
It is a super-2 number, since 2×200320125536532 (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 (20032012556653) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10016006276826 + 10016006276827.
It is an arithmetic number, because the mean of its divisors is an integer number (10016006276827).
Almost surely, 220032012553653 is an apocalyptic number.
It is an amenable number.
20032012553653 is a deficient number, since it is larger than the sum of its proper divisors (1).
20032012553653 is an equidigital number, since it uses as much as digits as its factorization.
20032012553653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162000, while the sum is 37.
Adding to 20032012553653 its reverse (35635521023002), we get a palindrome (55667533576655).
The spelling of 20032012553653 in words is "twenty trillion, thirty-two billion, twelve million, five hundred fifty-three thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •