Base | Representation |
---|---|
bin | 11001000000101101101010… |
… | …110110000010100110001001 |
3 | 112102110220202001211021020022 |
4 | 121000231222312002212021 |
5 | 103404220402143003121 |
6 | 1025541221053510225 |
7 | 32112152333315165 |
oct | 3100555266024611 |
9 | 472426661737208 |
10 | 110000199969161 |
11 | 3205a906201a67 |
12 | 104069384a2375 |
13 | 494bc888476c8 |
14 | 1d24076715ca5 |
15 | cab557062aab |
hex | 640b6ad82989 |
110000199969161 has 2 divisors, whose sum is σ = 110000199969162. Its totient is φ = 110000199969160.
The previous prime is 110000199969131. The next prime is 110000199969173. The reversal of 110000199969161 is 161969991000011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78643907059600 + 31356292909561 = 8868140^2 + 5599669^2 .
It is an emirp because it is prime and its reverse (161969991000011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110000199969161 - 226 = 110000132860297 is a prime.
It is not a weakly prime, because it can be changed into another prime (110000199969131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000099984580 + 55000099984581.
It is an arithmetic number, because the mean of its divisors is an integer number (55000099984581).
Almost surely, 2110000199969161 is an apocalyptic number.
It is an amenable number.
110000199969161 is a deficient number, since it is larger than the sum of its proper divisors (1).
110000199969161 is an equidigital number, since it uses as much as digits as its factorization.
110000199969161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 236196, while the sum is 53.
The spelling of 110000199969161 in words is "one hundred ten trillion, one hundred ninety-nine million, nine hundred sixty-nine thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •