Base | Representation |
---|---|
bin | 11001000010010100000001… |
… | …011001110001010000000101 |
3 | 112102212102102012022101000022 |
4 | 121002110001121301100011 |
5 | 103413020441111200401 |
6 | 1030103514235024525 |
7 | 32123122633110203 |
oct | 3102240131612005 |
9 | 472772365271008 |
10 | 110110100100101 |
11 | 320a2481a3aa62 |
12 | 104240a989b145 |
13 | 495945144859a |
14 | 1d29500540073 |
15 | cae33a4ce71b |
hex | 642501671405 |
110110100100101 has 2 divisors, whose sum is σ = 110110100100102. Its totient is φ = 110110100100100.
The previous prime is 110110100100097. The next prime is 110110100100103. The reversal of 110110100100101 is 101001001011011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109040062950625 + 1070037149476 = 10442225^2 + 1034426^2 .
It is a cyclic number.
It is not a de Polignac number, because 110110100100101 - 22 = 110110100100097 is a prime.
Together with 110110100100103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110110100100103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055050050050 + 55055050050051.
It is an arithmetic number, because the mean of its divisors is an integer number (55055050050051).
Almost surely, 2110110100100101 is an apocalyptic number.
It is an amenable number.
110110100100101 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110100100101 is an equidigital number, since it uses as much as digits as its factorization.
110110100100101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 110110100100101 its reverse (101001001011011), we get a palindrome (211111101111112).
The spelling of 110110100100101 in words is "one hundred ten trillion, one hundred ten billion, one hundred million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •