Base | Representation |
---|---|
bin | 1001010101100010… |
… | …01011100001111101 |
3 | 110221022220111222102 |
4 | 10222301023201331 |
5 | 40231200041103 |
6 | 2145215154445 |
7 | 235133366234 |
oct | 45261134175 |
9 | 13838814872 |
10 | 5012502653 |
11 | 2142477484 |
12 | b7a815a25 |
13 | 61b618602 |
14 | 3579d7b1b |
15 | 1e50c5e88 |
hex | 12ac4b87d |
5012502653 has 4 divisors (see below), whose sum is σ = 5012829888. Its totient is φ = 5012175420.
The previous prime is 5012502617. The next prime is 5012502661. The reversal of 5012502653 is 3562052105.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5012502653 - 228 = 4744067197 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 (5012501653) 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 3 ways as a sum of consecutive naturals, for example, 139451 + ... + 171672.
It is an arithmetic number, because the mean of its divisors is an integer number (1253207472).
Almost surely, 25012502653 is an apocalyptic number.
It is an amenable number.
5012502653 is a deficient number, since it is larger than the sum of its proper divisors (327235).
5012502653 is a wasteful number, since it uses less digits than its factorization.
5012502653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327234.
The product of its (nonzero) digits is 9000, while the sum is 29.
The square root of 5012502653 is about 70799.0300286664. The cubic root of 5012502653 is about 1711.4000427302.
Adding to 5012502653 its reverse (3562052105), we get a palindrome (8574554758).
The spelling of 5012502653 in words is "five billion, twelve million, five hundred two thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •