Base | Representation |
---|---|
bin | 11001000010001010101110… |
… | …000000011010100101011011 |
3 | 112102211110122001002000122102 |
4 | 121002022232000122211123 |
5 | 103412340011404311024 |
6 | 1030055143122114015 |
7 | 32122320250205015 |
oct | 3102125600324533 |
9 | 472743561060572 |
10 | 110100111010139 |
11 | 320992163a7908 |
12 | 104221804ab90b |
13 | 495851baaac73 |
14 | 1d28c33a1b1b5 |
15 | cade535791ae |
hex | 6422ae01a95b |
110100111010139 has 2 divisors, whose sum is σ = 110100111010140. Its totient is φ = 110100111010138.
The previous prime is 110100111010033. The next prime is 110100111010151. The reversal of 110100111010139 is 931010111001011.
It is a strong prime.
It is an emirp because it is prime and its reverse (931010111001011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110100111010139 - 224 = 110100094232923 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110100111010139.
It is not a weakly prime, because it can be changed into another prime (110100111019139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050055505069 + 55050055505070.
It is an arithmetic number, because the mean of its divisors is an integer number (55050055505070).
Almost surely, 2110100111010139 is an apocalyptic number.
110100111010139 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100111010139 is an equidigital number, since it uses as much as digits as its factorization.
110100111010139 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 20.
The spelling of 110100111010139 in words is "one hundred ten trillion, one hundred billion, one hundred eleven million, ten thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •