Base | Representation |
---|---|
bin | 1101001000110… |
… | …11111000000101 |
3 | 21200101111002111 |
4 | 12210123320011 |
5 | 211203332121 |
6 | 14534141021 |
7 | 2505544354 |
oct | 644337005 |
9 | 250344074 |
10 | 110214661 |
11 | 572389a7 |
12 | 30ab1771 |
13 | 19aabc9b |
14 | 108cd99b |
15 | 9a212e1 |
hex | 691be05 |
110214661 has 2 divisors, whose sum is σ = 110214662. Its totient is φ = 110214660.
The previous prime is 110214659. The next prime is 110214673. The reversal of 110214661 is 166412011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105884100 + 4330561 = 10290^2 + 2081^2 .
It is an emirp because it is prime and its reverse (166412011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110214661 - 21 = 110214659 is a prime.
Together with 110214659, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110214631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55107330 + 55107331.
It is an arithmetic number, because the mean of its divisors is an integer number (55107331).
Almost surely, 2110214661 is an apocalyptic number.
It is an amenable number.
110214661 is a deficient number, since it is larger than the sum of its proper divisors (1).
110214661 is an equidigital number, since it uses as much as digits as its factorization.
110214661 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 22.
The square root of 110214661 is about 10498.3170556047. The cubic root of 110214661 is about 479.4534592382.
Adding to 110214661 its reverse (166412011), we get a palindrome (276626672).
The spelling of 110214661 in words is "one hundred ten million, two hundred fourteen thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •