Base | Representation |
---|---|
bin | 11001000010011110010111… |
… | …000000111010001011111001 |
3 | 112102220111001202220210102222 |
4 | 121002132113000322023321 |
5 | 103413211204211200324 |
6 | 1030112551514333425 |
7 | 32123664665415203 |
oct | 3102362700721371 |
9 | 472814052823388 |
10 | 110121200100089 |
11 | 320a715866a272 |
12 | 1042628712a275 |
13 | 495a4cccb6709 |
14 | 1d29c74801773 |
15 | cae789c2355e |
hex | 64279703a2f9 |
110121200100089 has 2 divisors, whose sum is σ = 110121200100090. Its totient is φ = 110121200100088.
The previous prime is 110121200100019. The next prime is 110121200100143. The reversal of 110121200100089 is 980001002121011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83716863694864 + 26404336405225 = 9149692^2 + 5138515^2 .
It is a cyclic number.
It is not a de Polignac number, because 110121200100089 - 224 = 110121183322873 is a prime.
It is a super-2 number, since 2×1101212001000892 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110121200100019) 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, 55060600050044 + 55060600050045.
It is an arithmetic number, because the mean of its divisors is an integer number (55060600050045).
Almost surely, 2110121200100089 is an apocalyptic number.
It is an amenable number.
110121200100089 is a deficient number, since it is larger than the sum of its proper divisors (1).
110121200100089 is an equidigital number, since it uses as much as digits as its factorization.
110121200100089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 26.
The spelling of 110121200100089 in words is "one hundred ten trillion, one hundred twenty-one billion, two hundred million, one hundred thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •