Base | Representation |
---|---|
bin | 100101000001010110010… |
… | …0000001111111100000001 |
3 | 200000102100220110000201110 |
4 | 1022002230200033330001 |
5 | 1131331000131213010 |
6 | 14453242424153533 |
7 | 1033414511262354 |
oct | 112025440177401 |
9 | 20012326400643 |
10 | 5088135413505 |
11 | 1691958880181 |
12 | 6a21463088a9 |
13 | 2aba69801a11 |
14 | 1383a4b9829b |
15 | 8c54a038120 |
hex | 4a0ac80ff01 |
5088135413505 has 8 divisors (see below), whose sum is σ = 8141016661632. Its totient is φ = 2713672220528.
The previous prime is 5088135413503. The next prime is 5088135413507. The reversal of 5088135413505 is 5053145318805.
It is an interprime number because it is at equal distance from previous prime (5088135413503) and next prime (5088135413507).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5088135413505 - 21 = 5088135413503 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5088135413503) 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 7 ways as a sum of consecutive naturals, for example, 169604513769 + ... + 169604513798.
It is an arithmetic number, because the mean of its divisors is an integer number (1017627082704).
Almost surely, 25088135413505 is an apocalyptic number.
It is an amenable number.
5088135413505 is a deficient number, since it is larger than the sum of its proper divisors (3052881248127).
5088135413505 is a wasteful number, since it uses less digits than its factorization.
5088135413505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339209027575.
The product of its (nonzero) digits is 1440000, while the sum is 48.
The spelling of 5088135413505 in words is "five trillion, eighty-eight billion, one hundred thirty-five million, four hundred thirteen thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •