Base | Representation |
---|---|
bin | 1010100010111001… |
… | …11100010110110111 |
3 | 112121120010110101021 |
4 | 11101130330112313 |
5 | 43043321242142 |
6 | 2333441442011 |
7 | 260204014165 |
oct | 52134742667 |
9 | 15546113337 |
10 | 5661509047 |
11 | 24458575a7 |
12 | 1120040307 |
13 | 6c2c1226c |
14 | 3b9c9a235 |
15 | 232074267 |
hex | 15173c5b7 |
5661509047 has 2 divisors, whose sum is σ = 5661509048. Its totient is φ = 5661509046.
The previous prime is 5661509023. The next prime is 5661509053. The reversal of 5661509047 is 7409051665.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5661509047 - 215 = 5661476279 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5661508994 and 5661509012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5661509017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2830754523 + 2830754524.
It is an arithmetic number, because the mean of its divisors is an integer number (2830754524).
Almost surely, 25661509047 is an apocalyptic number.
5661509047 is a deficient number, since it is larger than the sum of its proper divisors (1).
5661509047 is an equidigital number, since it uses as much as digits as its factorization.
5661509047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 226800, while the sum is 43.
The square root of 5661509047 is about 75242.9999867097. Note that the first 4 decimals coincide. The cubic root of 5661509047 is about 1782.2860254053.
The spelling of 5661509047 in words is "five billion, six hundred sixty-one million, five hundred nine thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •