Base | Representation |
---|---|
bin | 10000000010100000010… |
… | …01110001111100100001 |
3 | 1221200111010220212120012 |
4 | 20001100021301330201 |
5 | 33012123220230131 |
6 | 1101101101254305 |
7 | 54546533266361 |
oct | 10012011617441 |
9 | 1850433825505 |
10 | 551100555041 |
11 | 1a27a1994873 |
12 | 8a982564395 |
13 | 3cc78c03caa |
14 | 1c95db989a1 |
15 | e506e1d52b |
hex | 8050271f21 |
551100555041 has 2 divisors, whose sum is σ = 551100555042. Its totient is φ = 551100555040.
The previous prime is 551100554989. The next prime is 551100555043. The reversal of 551100555041 is 140555001155.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 495234505441 + 55866049600 = 703729^2 + 236360^2 .
It is a cyclic number.
It is not a de Polignac number, because 551100555041 - 214 = 551100538657 is a prime.
It is a Sophie Germain prime.
Together with 551100555043, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 551100554989 and 551100555007.
It is not a weakly prime, because it can be changed into another prime (551100555043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275550277520 + 275550277521.
It is an arithmetic number, because the mean of its divisors is an integer number (275550277521).
Almost surely, 2551100555041 is an apocalyptic number.
It is an amenable number.
551100555041 is a deficient number, since it is larger than the sum of its proper divisors (1).
551100555041 is an equidigital number, since it uses as much as digits as its factorization.
551100555041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12500, while the sum is 32.
Adding to 551100555041 its reverse (140555001155), we get a palindrome (691655556196).
The spelling of 551100555041 in words is "five hundred fifty-one billion, one hundred million, five hundred fifty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •