Base | Representation |
---|---|
bin | 11001000010001100011110… |
… | …101010001100010111011011 |
3 | 112102211122111202102222020102 |
4 | 121002030132222030113123 |
5 | 103412402344224311024 |
6 | 1030100054435250015 |
7 | 32122415140015055 |
oct | 3102143652142733 |
9 | 472748452388212 |
10 | 110102001010139 |
11 | 32099aa6242886 |
12 | 1042260944990b |
13 | 495876051cc68 |
14 | 1d28d72a408d5 |
15 | cae01445e1ae |
hex | 64231ea8c5db |
110102001010139 has 2 divisors, whose sum is σ = 110102001010140. Its totient is φ = 110102001010138.
The previous prime is 110102001010081. The next prime is 110102001010153. The reversal of 110102001010139 is 931010100201011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110102001010139 - 212 = 110102001006043 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110102001010139.
It is not a weakly prime, because it can be changed into another prime (110102001010039) 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, 55051000505069 + 55051000505070.
It is an arithmetic number, because the mean of its divisors is an integer number (55051000505070).
Almost surely, 2110102001010139 is an apocalyptic number.
110102001010139 is a deficient number, since it is larger than the sum of its proper divisors (1).
110102001010139 is an equidigital number, since it uses as much as digits as its factorization.
110102001010139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 20.
The spelling of 110102001010139 in words is "one hundred ten trillion, one hundred two billion, one million, ten thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •