Base | Representation |
---|---|
bin | 101000011000101100110… |
… | …0011000001110100001001 |
3 | 201122122001212100022021022 |
4 | 1100301121203001310021 |
5 | 1211420112111214004 |
6 | 15445524355322225 |
7 | 1112006021254316 |
oct | 120613143016411 |
9 | 21578055308238 |
10 | 5550600101129 |
11 | 184aaa6064956 |
12 | 7578b08b0375 |
13 | 31355b3b4685 |
14 | 152916cabd0d |
15 | 995b57372be |
hex | 50c598c1d09 |
5550600101129 has 2 divisors, whose sum is σ = 5550600101130. Its totient is φ = 5550600101128.
The previous prime is 5550600101051. The next prime is 5550600101149. The reversal of 5550600101129 is 9211010060555.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3183540925504 + 2367059175625 = 1784248^2 + 1538525^2 .
It is a cyclic number.
It is not a de Polignac number, because 5550600101129 - 28 = 5550600100873 is a prime.
It is a super-2 number, since 2×55506001011292 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5550600101149) 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, 2775300050564 + 2775300050565.
It is an arithmetic number, because the mean of its divisors is an integer number (2775300050565).
Almost surely, 25550600101129 is an apocalyptic number.
It is an amenable number.
5550600101129 is a deficient number, since it is larger than the sum of its proper divisors (1).
5550600101129 is an equidigital number, since it uses as much as digits as its factorization.
5550600101129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 35.
The spelling of 5550600101129 in words is "five trillion, five hundred fifty billion, six hundred million, one hundred one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •