Base | Representation |
---|---|
bin | 100110101000111110110… |
… | …1100110111110010011111 |
3 | 200210200211000022211201102 |
4 | 1031101331230313302133 |
5 | 1144002242223231303 |
6 | 15143410245103315 |
7 | 1055453545243016 |
oct | 115217554676237 |
9 | 20720730284642 |
10 | 5310688492703 |
11 | 1768283228600 |
12 | 7192b69b7b3b |
13 | 2c6a46420a69 |
14 | 14507826ba7d |
15 | 9322343b288 |
hex | 4d47db37c9f |
5310688492703 has 12 divisors (see below), whose sum is σ = 5837584413024. Its totient is φ = 4827719925600.
The previous prime is 5310688492679. The next prime is 5310688492727. The reversal of 5310688492703 is 3072948860135.
It is an interprime number because it is at equal distance from previous prime (5310688492679) and next prime (5310688492727).
It is not a de Polignac number, because 5310688492703 - 26 = 5310688492639 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5310688492763) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2526650 + ... + 4123752.
It is an arithmetic number, because the mean of its divisors is an integer number (486465367752).
It is a 3-persistent number, because k⋅5310688492703 is pandigital for 1 ≤ k ≤ 3, but not for k = 4.
Almost surely, 25310688492703 is an apocalyptic number.
5310688492703 is a deficient number, since it is larger than the sum of its proper divisors (526895920321).
5310688492703 is a wasteful number, since it uses less digits than its factorization.
5310688492703 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1624606 (or 1624595 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 56.
The spelling of 5310688492703 in words is "five trillion, three hundred ten billion, six hundred eighty-eight million, four hundred ninety-two thousand, seven hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •