Base | Representation |
---|---|
bin | 11001000010010100110111… |
… | …000010100111011011111001 |
3 | 112102212111201220122000221102 |
4 | 121002110313002213123321 |
5 | 103413024312000001444 |
6 | 1030104143423021145 |
7 | 32123154141121613 |
oct | 3102246702473371 |
9 | 472774656560842 |
10 | 110111000000249 |
11 | 320a28a3a04296 |
12 | 104242bb13a7b5 |
13 | 4959565a08691 |
14 | 1d29587c71db3 |
15 | cae38e4db84e |
hex | 6425370a76f9 |
110111000000249 has 2 divisors, whose sum is σ = 110111000000250. Its totient is φ = 110111000000248.
The previous prime is 110111000000219. The next prime is 110111000000251. The reversal of 110111000000249 is 942000000111011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108742287193849 + 1368712806400 = 10427957^2 + 1169920^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110111000000249 is a prime.
Together with 110111000000251, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110111000000249.
It is not a weakly prime, because it can be changed into another prime (110111000000219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055500000124 + 55055500000125.
It is an arithmetic number, because the mean of its divisors is an integer number (55055500000125).
Almost surely, 2110111000000249 is an apocalyptic number.
It is an amenable number.
110111000000249 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111000000249 is an equidigital number, since it uses as much as digits as its factorization.
110111000000249 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 110111000000249 in words is "one hundred ten trillion, one hundred eleven billion, two hundred forty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •