Base | Representation |
---|---|
bin | 1001011010100001… |
… | …00000110000100111 |
3 | 111001020111112200211 |
4 | 10231100200300213 |
5 | 40322343124003 |
6 | 2153310320251 |
7 | 236151406342 |
oct | 45520406047 |
9 | 14036445624 |
10 | 5054270503 |
11 | 2164005267 |
12 | b907b9087 |
13 | 627180a09 |
14 | 35d38b459 |
15 | 1e8ac696d |
hex | 12d420c27 |
5054270503 has 8 divisors (see below), whose sum is σ = 5320938800. Its totient is φ = 4787667648.
The previous prime is 5054270497. The next prime is 5054270509. The reversal of 5054270503 is 3050724505.
It is an interprime number because it is at equal distance from previous prime (5054270497) and next prime (5054270509).
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 5054270503 - 25 = 5054270471 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 (5054270509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 279913 + ... + 297421.
It is an arithmetic number, because the mean of its divisors is an integer number (665117350).
Almost surely, 25054270503 is an apocalyptic number.
5054270503 is a deficient number, since it is larger than the sum of its proper divisors (266668297).
5054270503 is a wasteful number, since it uses less digits than its factorization.
5054270503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32721.
The product of its (nonzero) digits is 21000, while the sum is 31.
The square root of 5054270503 is about 71093.3928223995. The cubic root of 5054270503 is about 1716.1404471299.
The spelling of 5054270503 in words is "five billion, fifty-four million, two hundred seventy thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •