Base | Representation |
---|---|
bin | 1001111001000000… |
… | …00110000000010101 |
3 | 111201001201122002020 |
4 | 10330200012000111 |
5 | 41333330412321 |
6 | 2234524003353 |
7 | 245405240544 |
oct | 47440060025 |
9 | 14631648066 |
10 | 5310013461 |
11 | 2285400785 |
12 | 1042390559 |
13 | 6681543cc |
14 | 38532015b |
15 | 2112924c6 |
hex | 13c806015 |
5310013461 has 24 divisors (see below), whose sum is σ = 7644358944. Its totient is φ = 3277121280.
The previous prime is 5310013447. The next prime is 5310013481. The reversal of 5310013461 is 1643100135.
It is not a de Polignac number, because 5310013461 - 27 = 5310013333 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5310013411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2686 + ... + 103088.
It is an arithmetic number, because the mean of its divisors is an integer number (318514956).
Almost surely, 25310013461 is an apocalyptic number.
5310013461 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
5310013461 is a deficient number, since it is larger than the sum of its proper divisors (2334345483).
5310013461 is a wasteful number, since it uses less digits than its factorization.
5310013461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100501 (or 100484 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 24.
The square root of 5310013461 is about 72869.8391723215. The cubic root of 5310013461 is about 1744.6107358525.
Adding to 5310013461 its reverse (1643100135), we get a palindrome (6953113596).
The spelling of 5310013461 in words is "five billion, three hundred ten million, thirteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.144 sec. • engine limits •