Base | Representation |
---|---|
bin | 1010010101110000… |
… | …01010101100001011 |
3 | 112022212120102212001 |
4 | 11022320022230023 |
5 | 42332102031011 |
6 | 2314501331431 |
7 | 254364315343 |
oct | 51270125413 |
9 | 15285512761 |
10 | 5551205131 |
11 | 239956863a |
12 | 10ab106b77 |
13 | 6a6101784 |
14 | 3a9385d23 |
15 | 2275367c1 |
hex | 14ae0ab0b |
5551205131 has 2 divisors, whose sum is σ = 5551205132. Its totient is φ = 5551205130.
The previous prime is 5551205113. The next prime is 5551205137. The reversal of 5551205131 is 1315021555.
Together with previous prime (5551205113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5551205131 - 27 = 5551205003 is a prime.
It is a super-2 number, since 2×55512051312 = 61631756812881454322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5551205131.
It is not a weakly prime, because it can be changed into another prime (5551205137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2775602565 + 2775602566.
It is an arithmetic number, because the mean of its divisors is an integer number (2775602566).
Almost surely, 25551205131 is an apocalyptic number.
5551205131 is a deficient number, since it is larger than the sum of its proper divisors (1).
5551205131 is an equidigital number, since it uses as much as digits as its factorization.
5551205131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3750, while the sum is 28.
The square root of 5551205131 is about 74506.4099994088. The cubic root of 5551205131 is about 1770.6351929860.
Adding to 5551205131 its reverse (1315021555), we get a palindrome (6866226686).
The spelling of 5551205131 in words is "five billion, five hundred fifty-one million, two hundred five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •