Base | Representation |
---|---|
bin | 1001010110100100011110… |
… | …01011101100010100011011 |
3 | 2200211011021002001211100002 |
4 | 10223102033023230110123 |
5 | 10143431103114322001 |
6 | 111424114130203215 |
7 | 4221616065224240 |
oct | 453221713542433 |
9 | 80734232054302 |
10 | 20566705620251 |
11 | 660a32217130a |
12 | 2381b7012350b |
13 | b625801b400b |
14 | 5116107415c7 |
15 | 259ec1c8746b |
hex | 12b48f2ec51b |
20566705620251 has 8 divisors (see below), whose sum is σ = 23712813560544. Its totient is φ = 17472599464320.
The previous prime is 20566705620221. The next prime is 20566705620259. The reversal of 20566705620251 is 15202650766502.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20566705620251 - 218 = 20566705358107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20566705620196 and 20566705620205.
It is not an unprimeable number, because it can be changed into a prime (20566705620259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13000445240 + ... + 13000446821.
It is an arithmetic number, because the mean of its divisors is an integer number (2964101695068).
Almost surely, 220566705620251 is an apocalyptic number.
20566705620251 is a deficient number, since it is larger than the sum of its proper divisors (3146107940293).
20566705620251 is a wasteful number, since it uses less digits than its factorization.
20566705620251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26000892181.
The product of its (nonzero) digits is 1512000, while the sum is 47.
The spelling of 20566705620251 in words is "twenty trillion, five hundred sixty-six billion, seven hundred five million, six hundred twenty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •