Base | Representation |
---|---|
bin | 110011101111010101… |
… | …1000001000111000011 |
3 | 101121210110001212121121 |
4 | 1213132223001013003 |
5 | 3310023130013331 |
6 | 123013200533111 |
7 | 11012260266145 |
oct | 1473653010703 |
9 | 347713055547 |
10 | 111110001091 |
11 | 43137776391 |
12 | 1964a621197 |
13 | a62946ca9b |
14 | 55407a6c95 |
15 | 2d547a6c11 |
hex | 19deac11c3 |
111110001091 has 2 divisors, whose sum is σ = 111110001092. Its totient is φ = 111110001090.
The previous prime is 111110001061. The next prime is 111110001133. The reversal of 111110001091 is 190100011111.
It is a weak prime. It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 160100011111 and 111110001061.
It is a cyclic number.
It is not a de Polignac number, because 111110001091 - 229 = 110573130179 is a prime.
It is not a weakly prime, because it can be changed into another prime (111110001031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555000545 + 55555000546.
It is an arithmetic number, because the mean of its divisors is an integer number (55555000546).
Almost surely, 2111110001091 is an apocalyptic number.
111110001091 is a deficient number, since it is larger than the sum of its proper divisors (1).
111110001091 is an equidigital number, since it uses as much as digits as its factorization.
111110001091 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 16.
The spelling of 111110001091 in words is "one hundred eleven billion, one hundred ten million, one thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •