Base | Representation |
---|---|
bin | 11001000000110110111111… |
… | …01111110111110100011011 |
3 | 21012202102210100100100220211 |
4 | 30200123133233313310123 |
5 | 24202200423343424042 |
6 | 312552555121031551 |
7 | 14404662531452413 |
oct | 1440333757676433 |
9 | 235672710310824 |
10 | 55005105061147 |
11 | 1658759691064a |
12 | 62044364855b7 |
13 | 248cc6133c187 |
14 | d82392d9d643 |
15 | 655c2063c017 |
hex | 3206dfbf7d1b |
55005105061147 has 2 divisors, whose sum is σ = 55005105061148. Its totient is φ = 55005105061146.
The previous prime is 55005105061091. The next prime is 55005105061219. The reversal of 55005105061147 is 74116050150055.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 55005105061147 - 231 = 55002957577499 is a prime.
It is a super-3 number, since 3×550051050611473 (a number of 42 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (55005105061747) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27502552530573 + 27502552530574.
It is an arithmetic number, because the mean of its divisors is an integer number (27502552530574).
Almost surely, 255005105061147 is an apocalyptic number.
55005105061147 is a deficient number, since it is larger than the sum of its proper divisors (1).
55005105061147 is an equidigital number, since it uses as much as digits as its factorization.
55005105061147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105000, while the sum is 40.
The spelling of 55005105061147 in words is "fifty-five trillion, five billion, one hundred five million, sixty-one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •