Base | Representation |
---|---|
bin | 101000110010010100001… |
… | …1001100011110001100111 |
3 | 201211220001121101022010022 |
4 | 1101210220121203301213 |
5 | 1213320242142010210 |
6 | 15531103130545355 |
7 | 1115664146522144 |
oct | 121445031436147 |
9 | 21756047338108 |
10 | 5605610110055 |
11 | 187136485084a |
12 | 7664a359825b |
13 | 3187b70a8907 |
14 | 155454b473cb |
15 | 9ac34d5e155 |
hex | 51928663c67 |
5605610110055 has 8 divisors (see below), whose sum is σ = 6726773112192. Its totient is φ = 4484460767968.
The previous prime is 5605610110021. The next prime is 5605610110057. The reversal of 5605610110055 is 5500110165065.
5605610110055 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5605610110055 - 210 = 5605610109031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5605610109997 and 5605610110024.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5605610110057) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2489399 + ... + 4172328.
It is an arithmetic number, because the mean of its divisors is an integer number (840846639024).
Almost surely, 25605610110055 is an apocalyptic number.
5605610110055 is a deficient number, since it is larger than the sum of its proper divisors (1121163002137).
5605610110055 is a wasteful number, since it uses less digits than its factorization.
5605610110055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6830025.
The product of its (nonzero) digits is 22500, while the sum is 35.
The spelling of 5605610110055 in words is "five trillion, six hundred five billion, six hundred ten million, one hundred ten thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •