Base | Representation |
---|---|
bin | 11001000000101110011010… |
… | …111101000010100000010001 |
3 | 112102110222211022121021112102 |
4 | 121000232122331002200101 |
5 | 103404224030310011121 |
6 | 1025541433125410145 |
7 | 32112211334023016 |
oct | 3100563275024021 |
9 | 472428738537472 |
10 | 110001007110161 |
11 | 3206018a87aa42 |
12 | 10406b22869955 |
13 | 494c086b2aa2b |
14 | 1d241119bd70d |
15 | cab5a2d4a90b |
hex | 640b9af42811 |
110001007110161 has 2 divisors, whose sum is σ = 110001007110162. Its totient is φ = 110001007110160.
The previous prime is 110001007110097. The next prime is 110001007110187. The reversal of 110001007110161 is 161011700100011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108843962674561 + 1157044435600 = 10432831^2 + 1075660^2 .
It is a cyclic number.
It is not a de Polignac number, because 110001007110161 - 26 = 110001007110097 is a prime.
It is not a weakly prime, because it can be changed into another prime (110001007110461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55000503555080 + 55000503555081.
It is an arithmetic number, because the mean of its divisors is an integer number (55000503555081).
Almost surely, 2110001007110161 is an apocalyptic number.
It is an amenable number.
110001007110161 is a deficient number, since it is larger than the sum of its proper divisors (1).
110001007110161 is an equidigital number, since it uses as much as digits as its factorization.
110001007110161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 20.
Adding to 110001007110161 its reverse (161011700100011), we get a palindrome (271012707210172).
The spelling of 110001007110161 in words is "one hundred ten trillion, one billion, seven million, one hundred ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •