Base | Representation |
---|---|
bin | 110011100000011101… |
… | …1101100001110111111 |
3 | 101120111200012211000011 |
4 | 1213000323230032333 |
5 | 3303012412234201 |
6 | 122451454444051 |
7 | 10664021313343 |
oct | 1470073541677 |
9 | 346450184004 |
10 | 110611055551 |
11 | 42a0106a1a7 |
12 | 1952b503627 |
13 | a579c96939 |
14 | 54d4407623 |
15 | 2d25a9b151 |
hex | 19c0eec3bf |
110611055551 has 2 divisors, whose sum is σ = 110611055552. Its totient is φ = 110611055550.
The previous prime is 110611055549. The next prime is 110611055563. The reversal of 110611055551 is 155550116011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110611055551 - 21 = 110611055549 is a prime.
It is a super-2 number, since 2×1106110555512 (a number of 23 digits) contains 22 as substring.
Together with 110611055549, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110611053551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55305527775 + 55305527776.
It is an arithmetic number, because the mean of its divisors is an integer number (55305527776).
Almost surely, 2110611055551 is an apocalyptic number.
110611055551 is a deficient number, since it is larger than the sum of its proper divisors (1).
110611055551 is an equidigital number, since it uses as much as digits as its factorization.
110611055551 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3750, while the sum is 31.
The spelling of 110611055551 in words is "one hundred ten billion, six hundred eleven million, fifty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •