Base | Representation |
---|---|
bin | 11001000010010100111101… |
… | …100110000111100011011011 |
3 | 112102212112000120120002021022 |
4 | 121002110331212013203123 |
5 | 103413030023123021024 |
6 | 1030104202352033055 |
7 | 32123156644626545 |
oct | 3102247546074333 |
9 | 472775016502238 |
10 | 110111109970139 |
11 | 320a294aa952a3 |
12 | 1042432bb3278b |
13 | 4959582730115 |
14 | 1d295986da695 |
15 | cae398eb035e |
hex | 64253d9878db |
110111109970139 has 2 divisors, whose sum is σ = 110111109970140. Its totient is φ = 110111109970138.
The previous prime is 110111109970109. The next prime is 110111109970193. The reversal of 110111109970139 is 931079901111011.
Together with next prime (110111109970193) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110111109970139 - 232 = 110106815002843 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110111109970139.
It is not a weakly prime, because it can be changed into another prime (110111109970109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055554985069 + 55055554985070.
It is an arithmetic number, because the mean of its divisors is an integer number (55055554985070).
Almost surely, 2110111109970139 is an apocalyptic number.
110111109970139 is a deficient number, since it is larger than the sum of its proper divisors (1).
110111109970139 is an equidigital number, since it uses as much as digits as its factorization.
110111109970139 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15309, while the sum is 44.
The spelling of 110111109970139 in words is "one hundred ten trillion, one hundred eleven billion, one hundred nine million, nine hundred seventy thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •