Base | Representation |
---|---|
bin | 11001000010001010100111… |
… | …011100110011000110101001 |
3 | 112102211110100101002102221111 |
4 | 121002022213130303012221 |
5 | 103412334300224310324 |
6 | 1030055124152310321 |
7 | 32122314443213116 |
oct | 3102124734630651 |
9 | 472743311072844 |
10 | 110100001010089 |
11 | 3209916a2a6182 |
12 | 1042214b6a23a1 |
13 | 495850207588c |
14 | 1d28c2318590d |
15 | cade48a9b794 |
hex | 6422a77331a9 |
110100001010089 has 2 divisors, whose sum is σ = 110100001010090. Its totient is φ = 110100001010088.
The previous prime is 110100001010057. The next prime is 110100001010113. The reversal of 110100001010089 is 980010100001011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98869513189225 + 11230487820864 = 9943315^2 + 3351192^2 .
It is an emirp because it is prime and its reverse (980010100001011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110100001010089 - 25 = 110100001010057 is a prime.
It is not a weakly prime, because it can be changed into another prime (110100001010039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050000505044 + 55050000505045.
It is an arithmetic number, because the mean of its divisors is an integer number (55050000505045).
Almost surely, 2110100001010089 is an apocalyptic number.
It is an amenable number.
110100001010089 is a deficient number, since it is larger than the sum of its proper divisors (1).
110100001010089 is an equidigital number, since it uses as much as digits as its factorization.
110100001010089 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 22.
It can be divided in two parts, 11010000 and 1010089, that added together give a square (12020089 = 34672).
The spelling of 110100001010089 in words is "one hundred ten trillion, one hundred billion, one million, ten thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •