Base | Representation |
---|---|
bin | 1001000111010010010101… |
… | …10111011101101010001111 |
3 | 2121221221210201020220201220 |
4 | 10203221022313131222033 |
5 | 10111330120301102102 |
6 | 110342545521334423 |
7 | 4135645605411330 |
oct | 443511267355217 |
9 | 77857721226656 |
10 | 20041573456527 |
11 | 6427646808277 |
12 | 22b8236497413 |
13 | b24bb233745c |
14 | 4d40357b0287 |
15 | 24b4d9a771bc |
hex | 123a4addda8f |
20041573456527 has 8 divisors (see below), whose sum is σ = 30539540505216. Its totient is φ = 11452327689432.
The previous prime is 20041573456523. The next prime is 20041573456547. The reversal of 20041573456527 is 72565437514002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20041573456527 - 22 = 20041573456523 is a prime.
It is a super-2 number, since 2×200415734565272 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20041573456527.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20041573456523) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 477180320373 + ... + 477180320414.
It is an arithmetic number, because the mean of its divisors is an integer number (3817442563152).
Almost surely, 220041573456527 is an apocalyptic number.
20041573456527 is a deficient number, since it is larger than the sum of its proper divisors (10497967048689).
20041573456527 is an equidigital number, since it uses as much as digits as its factorization.
20041573456527 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 954360640797.
The product of its (nonzero) digits is 7056000, while the sum is 51.
The spelling of 20041573456527 in words is "twenty trillion, forty-one billion, five hundred seventy-three million, four hundred fifty-six thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •