Base | Representation |
---|---|
bin | 100100011010101100100… |
… | …1100111010010010110101 |
3 | 122201111010100121201222010 |
4 | 1020311121030322102311 |
5 | 1124001003131102230 |
6 | 14351154312154433 |
7 | 1024415605264614 |
oct | 110653114722265 |
9 | 18644110551863 |
10 | 5005133456565 |
11 | 165a735397450 |
12 | 68a041098a19 |
13 | 2a3c9c77ba28 |
14 | 13436d46787b |
15 | 8a2dd23a9b0 |
hex | 48d5933a4b5 |
5005133456565 has 32 divisors (see below), whose sum is σ = 8740543458816. Its totient is φ = 2425534007360.
The previous prime is 5005133456551. The next prime is 5005133456593. The reversal of 5005133456565 is 5656543315005.
It is not a de Polignac number, because 5005133456565 - 230 = 5004059714741 is a prime.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7148067 + ... + 7816976.
It is an arithmetic number, because the mean of its divisors is an integer number (273141983088).
Almost surely, 25005133456565 is an apocalyptic number.
5005133456565 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5005133456565 is a deficient number, since it is larger than the sum of its proper divisors (3735410002251).
5005133456565 is a wasteful number, since it uses less digits than its factorization.
5005133456565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14967089.
The product of its (nonzero) digits is 4050000, while the sum is 48.
The spelling of 5005133456565 in words is "five trillion, five billion, one hundred thirty-three million, four hundred fifty-six thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •