Base | Representation |
---|---|
bin | 1010011101100010… |
… | …01000100000101001 |
3 | 112111102101020111112 |
4 | 11032301020200221 |
5 | 43000304020212 |
6 | 2325152240105 |
7 | 256116131162 |
oct | 51661104051 |
9 | 15442336445 |
10 | 5616470057 |
11 | 24223950a0 |
12 | 1108b40035 |
13 | 6b67a2c83 |
14 | 3b3cd4769 |
15 | 22d129422 |
hex | 14ec48829 |
5616470057 has 4 divisors (see below), whose sum is σ = 6127058256. Its totient is φ = 5105881860.
The previous prime is 5616470029. The next prime is 5616470059. The reversal of 5616470057 is 7500746165.
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 5616470057 - 212 = 5616465961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5616469996 and 5616470023.
It is not an unprimeable number, because it can be changed into a prime (5616470059) 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 3 ways as a sum of consecutive naturals, for example, 255294083 + ... + 255294104.
It is an arithmetic number, because the mean of its divisors is an integer number (1531764564).
Almost surely, 25616470057 is an apocalyptic number.
It is an amenable number.
5616470057 is a deficient number, since it is larger than the sum of its proper divisors (510588199).
5616470057 is a wasteful number, since it uses less digits than its factorization.
5616470057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 510588198.
The product of its (nonzero) digits is 176400, while the sum is 41.
The square root of 5616470057 is about 74943.1121384747. The cubic root of 5616470057 is about 1777.5472316130.
The spelling of 5616470057 in words is "five billion, six hundred sixteen million, four hundred seventy thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •