Base | Representation |
---|---|
bin | 11001010010011111100100… |
… | …01111000010110001100111 |
3 | 21021220100201121010102021121 |
4 | 30221033302033002301213 |
5 | 24242112314414023421 |
6 | 314135202052354411 |
7 | 14466522363244126 |
oct | 1451176217026147 |
9 | 237810647112247 |
10 | 55611005611111 |
11 | 167a0549989715 |
12 | 62a1951315a07 |
13 | 2505131585062 |
14 | da3830b65abd |
15 | 6668834ead41 |
hex | 3293f23c2c67 |
55611005611111 has 4 divisors (see below), whose sum is σ = 58882241235312. Its totient is φ = 52339769986912.
The previous prime is 55611005611093. The next prime is 55611005611129. The reversal of 55611005611111 is 11111650011655.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (55611005611093) and next prime (55611005611129).
It is a cyclic number.
It is not a de Polignac number, because 55611005611111 - 211 = 55611005609063 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55611005611181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1635617812075 + ... + 1635617812108.
It is an arithmetic number, because the mean of its divisors is an integer number (14720560308828).
Almost surely, 255611005611111 is an apocalyptic number.
55611005611111 is a deficient number, since it is larger than the sum of its proper divisors (3271235624201).
55611005611111 is a wasteful number, since it uses less digits than its factorization.
55611005611111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3271235624200.
The product of its (nonzero) digits is 4500, while the sum is 34.
Adding to 55611005611111 its reverse (11111650011655), we get a palindrome (66722655622766).
The spelling of 55611005611111 in words is "fifty-five trillion, six hundred eleven billion, five million, six hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •