Base | Representation |
---|---|
bin | 11001000000101110100000… |
… | …011111011000101101011011 |
3 | 112102111000001210101120120012 |
4 | 121000232200133120231123 |
5 | 103404224223100000331 |
6 | 1025541450244352135 |
7 | 32112213542413106 |
oct | 3100564037305533 |
9 | 472430053346505 |
10 | 110001100000091 |
11 | 32060228255583 |
12 | 10406b499a564b |
13 | 494c0a01521a1 |
14 | 1d2412007d73d |
15 | cab5ab09882b |
hex | 640ba07d8b5b |
110001100000091 has 2 divisors, whose sum is σ = 110001100000092. Its totient is φ = 110001100000090.
The previous prime is 110001100000061. The next prime is 110001100000109. The reversal of 110001100000091 is 190000001100011.
It is a happy number.
Together with next prime (110001100000109) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110001100000091 - 242 = 105603053488987 is a prime.
It is not a weakly prime, because it can be changed into another prime (110001100000061) 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, 55000550000045 + 55000550000046.
It is an arithmetic number, because the mean of its divisors is an integer number (55000550000046).
Almost surely, 2110001100000091 is an apocalyptic number.
110001100000091 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001100000091 is an equidigital number, since it uses as much as digits as its factorization.
110001100000091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 14.
The spelling of 110001100000091 in words is "one hundred ten trillion, one billion, one hundred million, ninety-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •