Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …00101011000010101101 |
3 | 1221122002010101001201212 |
4 | 20000233220223002231 |
5 | 33010014040130401 |
6 | 1100531012244205 |
7 | 54530160220643 |
oct | 10005750530255 |
9 | 1848063331655 |
10 | 550555005101 |
11 | 1a2541a47052 |
12 | 8a84b910665 |
13 | 3cbbcb9118a |
14 | 1c90b547193 |
15 | e4c40a8dbb |
hex | 802fa2b0ad |
550555005101 has 2 divisors, whose sum is σ = 550555005102. Its totient is φ = 550555005100.
The previous prime is 550555005083. The next prime is 550555005103. The reversal of 550555005101 is 101500555055.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 517681689001 + 32873316100 = 719501^2 + 181310^2 .
It is a cyclic number.
It is not a de Polignac number, because 550555005101 - 214 = 550554988717 is a prime.
It is a super-2 number, since 2×5505550051012 (a number of 24 digits) contains 22 as substring.
Together with 550555005103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (550555005103) 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, 275277502550 + 275277502551.
It is an arithmetic number, because the mean of its divisors is an integer number (275277502551).
Almost surely, 2550555005101 is an apocalyptic number.
It is an amenable number.
550555005101 is a deficient number, since it is larger than the sum of its proper divisors (1).
550555005101 is an equidigital number, since it uses as much as digits as its factorization.
550555005101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15625, while the sum is 32.
The spelling of 550555005101 in words is "five hundred fifty billion, five hundred fifty-five million, five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •