Base | Representation |
---|---|
bin | 10000010100111101101… |
… | …01001110000111001111 |
3 | 1222122001210020020110102 |
4 | 20022132311032013033 |
5 | 33142422142000142 |
6 | 1105420310001315 |
7 | 55350235366334 |
oct | 10123665160717 |
9 | 1878053206412 |
10 | 561010500047 |
11 | 1a6a17890168 |
12 | 9088934623b |
13 | 40b9805048a |
14 | 1d21dd9898b |
15 | e8d6e3d532 |
hex | 829ed4e1cf |
561010500047 has 2 divisors, whose sum is σ = 561010500048. Its totient is φ = 561010500046.
The previous prime is 561010499971. The next prime is 561010500049. The reversal of 561010500047 is 740005010165.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 561010500047 - 236 = 492291023311 is a prime.
Together with 561010500049, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 561010499992 and 561010500019.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (561010500049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 280505250023 + 280505250024.
It is an arithmetic number, because the mean of its divisors is an integer number (280505250024).
Almost surely, 2561010500047 is an apocalyptic number.
561010500047 is a deficient number, since it is larger than the sum of its proper divisors (1).
561010500047 is an equidigital number, since it uses as much as digits as its factorization.
561010500047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4200, while the sum is 29.
The spelling of 561010500047 in words is "five hundred sixty-one billion, ten million, five hundred thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •