Base | Representation |
---|---|
bin | 100110101000111001010… |
… | …1010000111010000000101 |
3 | 200210200100002201000122221 |
4 | 1031101302222013100011 |
5 | 1144001402311021404 |
6 | 15143340030052341 |
7 | 1055446135405024 |
oct | 115216252072005 |
9 | 20720302630587 |
10 | 5310503220229 |
11 | 1768198694659 |
12 | 71926494a0b1 |
13 | 2c6a16c2208c |
14 | 14505b8008bb |
15 | 93212040954 |
hex | 4d472a87405 |
5310503220229 has 2 divisors, whose sum is σ = 5310503220230. Its totient is φ = 5310503220228.
The previous prime is 5310503220203. The next prime is 5310503220289. The reversal of 5310503220229 is 9220223050135.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3156389284129 + 2154113936100 = 1776623^2 + 1467690^2 .
It is a cyclic number.
It is not a de Polignac number, because 5310503220229 - 221 = 5310501123077 is a prime.
It is a super-3 number, since 3×53105032202293 (a number of 39 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5310503220194 and 5310503220203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5310503220289) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2655251610114 + 2655251610115.
It is an arithmetic number, because the mean of its divisors is an integer number (2655251610115).
Almost surely, 25310503220229 is an apocalyptic number.
It is an amenable number.
5310503220229 is a deficient number, since it is larger than the sum of its proper divisors (1).
5310503220229 is an equidigital number, since it uses as much as digits as its factorization.
5310503220229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32400, while the sum is 34.
The spelling of 5310503220229 in words is "five trillion, three hundred ten billion, five hundred three million, two hundred twenty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •