Base | Representation |
---|---|
bin | 1001001101100011111010… |
… | …00110000001111100010001 |
3 | 2122201120021121211201011202 |
4 | 10212301331012001330101 |
5 | 10123343133103011003 |
6 | 111030002441520545 |
7 | 4160350264143635 |
oct | 446617506017421 |
9 | 78646247751152 |
10 | 20257164500753 |
11 | 6500019291794 |
12 | 2331b834a3155 |
13 | b3c31c783a8b |
14 | 5006483aadc5 |
15 | 251e06b60088 |
hex | 126c7d181f11 |
20257164500753 has 32 divisors (see below), whose sum is σ = 21766459253760. Its totient is φ = 18784236856320.
The previous prime is 20257164500747. The next prime is 20257164500777. The reversal of 20257164500753 is 35700546175202.
It is not a de Polignac number, because 20257164500753 - 24 = 20257164500737 is a prime.
It is a super-3 number, since 3×202571645007533 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20257164500698 and 20257164500707.
It is not an unprimeable number, because it can be changed into a prime (20257164500953) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1424447183 + ... + 1424461403.
It is an arithmetic number, because the mean of its divisors is an integer number (680201851680).
Almost surely, 220257164500753 is an apocalyptic number.
It is an amenable number.
20257164500753 is a deficient number, since it is larger than the sum of its proper divisors (1509294753007).
20257164500753 is a wasteful number, since it uses less digits than its factorization.
20257164500753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16497.
The product of its (nonzero) digits is 1764000, while the sum is 47.
The spelling of 20257164500753 in words is "twenty trillion, two hundred fifty-seven billion, one hundred sixty-four million, five hundred thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •