Base | Representation |
---|---|
bin | 110011010111100001… |
… | …1111010001101111101 |
3 | 101112201210000121002012 |
4 | 1212233003322031331 |
5 | 3301404133020333 |
6 | 122402024141005 |
7 | 10653420620444 |
oct | 1465703721575 |
9 | 345653017065 |
10 | 110311220093 |
11 | 428678983a8 |
12 | 19467007765 |
13 | a52cb259c9 |
14 | 54a6677d5b |
15 | 2d095c0e48 |
hex | 19af0fa37d |
110311220093 has 2 divisors, whose sum is σ = 110311220094. Its totient is φ = 110311220092.
The previous prime is 110311220039. The next prime is 110311220113. The reversal of 110311220093 is 390022113011.
Together with previous prime (110311220039) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93524649124 + 16786570969 = 305818^2 + 129563^2 .
It is an emirp because it is prime and its reverse (390022113011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110311220093 - 212 = 110311215997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110311220693) 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, 55155610046 + 55155610047.
It is an arithmetic number, because the mean of its divisors is an integer number (55155610047).
Almost surely, 2110311220093 is an apocalyptic number.
It is an amenable number.
110311220093 is a deficient number, since it is larger than the sum of its proper divisors (1).
110311220093 is an equidigital number, since it uses as much as digits as its factorization.
110311220093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 23.
The spelling of 110311220093 in words is "one hundred ten billion, three hundred eleven million, two hundred twenty thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •