Base | Representation |
---|---|
bin | 10000001001110111011… |
… | …110100010001101111111 |
3 | 10221010101012101120201111 |
4 | 100021313132202031333 |
5 | 121141444122234201 |
6 | 2205550425222451 |
7 | 143126314532233 |
oct | 20116736421577 |
9 | 3833335346644 |
10 | 1110106055551 |
11 | 39887aa23119 |
12 | 15b190331a27 |
13 | 808b47495bc |
14 | 3ba2d7565c3 |
15 | 1dd22d0cb51 |
hex | 102777a237f |
1110106055551 has 2 divisors, whose sum is σ = 1110106055552. Its totient is φ = 1110106055550.
The previous prime is 1110106055549. The next prime is 1110106055561. The reversal of 1110106055551 is 1555506010111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1110106055551 - 21 = 1110106055549 is a prime.
Together with 1110106055549, 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 (1110106055521) 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 as a sum of consecutive naturals, namely, 555053027775 + 555053027776.
It is an arithmetic number, because the mean of its divisors is an integer number (555053027776).
Almost surely, 21110106055551 is an apocalyptic number.
1110106055551 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110106055551 is an equidigital number, since it uses as much as digits as its factorization.
1110106055551 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3750, while the sum is 31.
The spelling of 1110106055551 in words is "one trillion, one hundred ten billion, one hundred six million, fifty-five thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •