Base | Representation |
---|---|
bin | 11001000000101110011011… |
… | …00110001000011011011111 |
3 | 21012201222220210120000112211 |
4 | 30200113031212020123133 |
5 | 24202112013410104214 |
6 | 312550514453341251 |
7 | 14404440541325512 |
oct | 1440271546103337 |
9 | 235658823500484 |
10 | 55000505550559 |
11 | 16585646583228 |
12 | 6203572037827 |
13 | 248c6aa46388a |
14 | d8207818cd79 |
15 | 655a519440c4 |
hex | 3205cd9886df |
55000505550559 has 2 divisors, whose sum is σ = 55000505550560. Its totient is φ = 55000505550558.
The previous prime is 55000505550479. The next prime is 55000505550581. The reversal of 55000505550559 is 95505550500055.
55000505550559 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 55000505550559 - 227 = 55000371332831 is a prime.
It is a super-2 number, since 2×550005055505592 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55000505554559) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27500252775279 + 27500252775280.
It is an arithmetic number, because the mean of its divisors is an integer number (27500252775280).
Almost surely, 255000505550559 is an apocalyptic number.
55000505550559 is a deficient number, since it is larger than the sum of its proper divisors (1).
55000505550559 is an equidigital number, since it uses as much as digits as its factorization.
55000505550559 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3515625, while the sum is 49.
The spelling of 55000505550559 in words is "fifty-five trillion, five hundred five million, five hundred fifty thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •