Base | Representation |
---|---|
bin | 1001000110001110110001… |
… | …10101001000000000100101 |
3 | 2121211111011210021221020120 |
4 | 10203013120311020000211 |
5 | 10110231323412040230 |
6 | 110314150322152153 |
7 | 4133222665401060 |
oct | 443073065100045 |
9 | 77744153257216 |
10 | 20005300502565 |
11 | 6413222662074 |
12 | 22b11b27b2659 |
13 | b216514880a1 |
14 | 4d23941c38d7 |
15 | 24a5b539a310 |
hex | 1231d8d48025 |
20005300502565 has 64 divisors (see below), whose sum is σ = 36677780298240. Its totient is φ = 9121121095680.
The previous prime is 20005300502563. The next prime is 20005300502591. The reversal of 20005300502565 is 56520500350002.
It is not a de Polignac number, because 20005300502565 - 21 = 20005300502563 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20005300502563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 405195201 + ... + 405244569.
It is an arithmetic number, because the mean of its divisors is an integer number (573090317160).
Almost surely, 220005300502565 is an apocalyptic number.
It is an amenable number.
20005300502565 is a deficient number, since it is larger than the sum of its proper divisors (16672479795675).
20005300502565 is a wasteful number, since it uses less digits than its factorization.
20005300502565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59502.
The product of its (nonzero) digits is 45000, while the sum is 33.
Adding to 20005300502565 its reverse (56520500350002), we get a palindrome (76525800852567).
The spelling of 20005300502565 in words is "twenty trillion, five billion, three hundred million, five hundred two thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •