Base | Representation |
---|---|
bin | 1001010110101101101001… |
… | …10101001010101000010001 |
3 | 2200211121222102022212000021 |
4 | 10223112310311022220101 |
5 | 10144021200321412333 |
6 | 111430251040223441 |
7 | 4222152136501003 |
oct | 453266465125021 |
9 | 80747872285007 |
10 | 20571632216593 |
11 | 66114200a3037 |
12 | 2382b0600ab81 |
13 | b62b86a81a93 |
14 | 51195ab76373 |
15 | 25a1ae53e82d |
hex | 12b5b4d4aa11 |
20571632216593 has 4 divisors (see below), whose sum is σ = 20572109526528. Its totient is φ = 20571154906660.
The previous prime is 20571632216579. The next prime is 20571632216671. The reversal of 20571632216593 is 39561223617502.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20571632216593 - 25 = 20571632216561 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20571632216593.
It is not an unprimeable number, because it can be changed into a prime (20571632216573) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 238590313 + ... + 238676518.
It is an arithmetic number, because the mean of its divisors is an integer number (5143027381632).
Almost surely, 220571632216593 is an apocalyptic number.
It is an amenable number.
20571632216593 is a deficient number, since it is larger than the sum of its proper divisors (477309935).
20571632216593 is an equidigital number, since it uses as much as digits as its factorization.
20571632216593 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477309934.
The product of its (nonzero) digits is 4082400, while the sum is 52.
The spelling of 20571632216593 in words is "twenty trillion, five hundred seventy-one billion, six hundred thirty-two million, two hundred sixteen thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •