Base | Representation |
---|---|
bin | 100100011010001010111… |
… | …0010101100111010000001 |
3 | 122201101012112112211101101 |
4 | 1020310111302230322001 |
5 | 1123441144120400023 |
6 | 14350450152134401 |
7 | 1024345563361624 |
oct | 110642562547201 |
9 | 18641175484341 |
10 | 5004002512513 |
11 | 165a204a67444 |
12 | 689986397401 |
13 | 2a3b4c385474 |
14 | 1342a3191dbb |
15 | 8a273ce11ad |
hex | 48d15cace81 |
5004002512513 has 16 divisors (see below), whose sum is σ = 5453584421760. Its totient is φ = 4578140514816.
The previous prime is 5004002512511. The next prime is 5004002512543. The reversal of 5004002512513 is 3152152004005.
It is a cyclic number.
It is not a de Polignac number, because 5004002512513 - 21 = 5004002512511 is a prime.
It is a super-2 number, since 2×50040025125132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5004002512511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49781520 + ... + 49881937.
It is an arithmetic number, because the mean of its divisors is an integer number (340849026360).
Almost surely, 25004002512513 is an apocalyptic number.
It is an amenable number.
5004002512513 is a deficient number, since it is larger than the sum of its proper divisors (449581909247).
5004002512513 is a wasteful number, since it uses less digits than its factorization.
5004002512513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99663576.
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 5004002512513 its reverse (3152152004005), we get a palindrome (8156154516518).
The spelling of 5004002512513 in words is "five trillion, four billion, two million, five hundred twelve thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •