Base | Representation |
---|---|
bin | 10000001010000100010… |
… | …11001101100011100111 |
3 | 1222001222010101200121112 |
4 | 20011002023031203213 |
5 | 33043432210012201 |
6 | 1103012031135235 |
7 | 55052256531521 |
oct | 10050213154347 |
9 | 1861863350545 |
10 | 555161016551 |
11 | 1a4495a14689 |
12 | 8b71637451b |
13 | 4047520473b |
14 | 1cc2716aa11 |
15 | e6936380bb |
hex | 81422cd8e7 |
555161016551 has 2 divisors, whose sum is σ = 555161016552. Its totient is φ = 555161016550.
The previous prime is 555161016503. The next prime is 555161016589. The reversal of 555161016551 is 155610161555.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-555161016551 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 555161016499 and 555161016508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (555161012551) 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 as a sum of consecutive naturals, namely, 277580508275 + 277580508276.
It is an arithmetic number, because the mean of its divisors is an integer number (277580508276).
Almost surely, 2555161016551 is an apocalyptic number.
555161016551 is a deficient number, since it is larger than the sum of its proper divisors (1).
555161016551 is an equidigital number, since it uses as much as digits as its factorization.
555161016551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112500, while the sum is 41.
The spelling of 555161016551 in words is "five hundred fifty-five billion, one hundred sixty-one million, sixteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •