Base | Representation |
---|---|
bin | 11001010001100001101110… |
… | …11100110110110100000011 |
3 | 21021210012000221022102020111 |
4 | 30220300313130312310003 |
5 | 24241041322110343132 |
6 | 314112031521452151 |
7 | 14464235604606145 |
oct | 1450606734666403 |
9 | 237705027272214 |
10 | 55577807121667 |
11 | 16788463234186 |
12 | 62974271a1057 |
13 | 2501c7065cb6c |
14 | da1da1a06c95 |
15 | 665a8dbc1647 |
hex | 328c37736d03 |
55577807121667 has 16 divisors (see below), whose sum is σ = 55857513559680. Its totient is φ = 55298418596928.
The previous prime is 55577807121643. The next prime is 55577807121673. The reversal of 55577807121667 is 76612170877555.
55577807121667 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 55577807121667 - 27 = 55577807121539 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55577807124667) 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 in 15 ways as a sum of consecutive naturals, for example, 2866746748 + ... + 2866766134.
It is an arithmetic number, because the mean of its divisors is an integer number (3491094597480).
Almost surely, 255577807121667 is an apocalyptic number.
55577807121667 is a deficient number, since it is larger than the sum of its proper divisors (279706438013).
55577807121667 is a wasteful number, since it uses less digits than its factorization.
55577807121667 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26850.
The product of its (nonzero) digits is 172872000, while the sum is 67.
The spelling of 55577807121667 in words is "fifty-five trillion, five hundred seventy-seven billion, eight hundred seven million, one hundred twenty-one thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •