Base | Representation |
---|---|
bin | 1001111001010011… |
… | …01000110101001011 |
3 | 111201020102202002202 |
4 | 10330221220311023 |
5 | 41340000443103 |
6 | 2235053350415 |
7 | 245435431046 |
oct | 47451506513 |
9 | 14636382082 |
10 | 5312515403 |
11 | 228685a4a8 |
12 | 104319840b |
13 | 66881c150 |
14 | 3857b1c5d |
15 | 2115d8988 |
hex | 13ca68d4b |
5312515403 has 8 divisors (see below), whose sum is σ = 5753134800. Its totient is φ = 4876462368.
The previous prime is 5312515393. The next prime is 5312515409. The reversal of 5312515403 is 3045152135.
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 5312515403 - 212 = 5312511307 is a prime.
It is a super-2 number, since 2×53125154032 = 56445639814224504818, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5312515409) 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, 1139168 + ... + 1143821.
It is an arithmetic number, because the mean of its divisors is an integer number (719141850).
Almost surely, 25312515403 is an apocalyptic number.
5312515403 is a deficient number, since it is larger than the sum of its proper divisors (440619397).
5312515403 is a wasteful number, since it uses less digits than its factorization.
5312515403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2283181.
The product of its (nonzero) digits is 9000, while the sum is 29.
The square root of 5312515403 is about 72887.0043491979. The cubic root of 5312515403 is about 1744.8846980900.
Adding to 5312515403 its reverse (3045152135), we get a palindrome (8357667538).
The spelling of 5312515403 in words is "five billion, three hundred twelve million, five hundred fifteen thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •