Base | Representation |
---|---|
bin | 1101000111010… |
… | …01000010010001 |
3 | 21122222220102202 |
4 | 12203221002101 |
5 | 211130201132 |
6 | 14525452545 |
7 | 2504016263 |
oct | 643510221 |
9 | 248886382 |
10 | 110006417 |
11 | 571064a4 |
12 | 30a11155 |
13 | 19a38271 |
14 | 10877b33 |
15 | 99ce762 |
hex | 68e9091 |
110006417 has 2 divisors, whose sum is σ = 110006418. Its totient is φ = 110006416.
The previous prime is 110006411. The next prime is 110006423. The reversal of 110006417 is 714600011.
It is a balanced prime because it is at equal distance from previous prime (110006411) and next prime (110006423).
It can be written as a sum of positive squares in only one way, i.e., 100982401 + 9024016 = 10049^2 + 3004^2 .
It is an emirp because it is prime and its reverse (714600011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110006417 - 26 = 110006353 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (110006411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55003208 + 55003209.
It is an arithmetic number, because the mean of its divisors is an integer number (55003209).
Almost surely, 2110006417 is an apocalyptic number.
It is an amenable number.
110006417 is a deficient number, since it is larger than the sum of its proper divisors (1).
110006417 is an equidigital number, since it uses as much as digits as its factorization.
110006417 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 20.
The square root of 110006417 is about 10488.3943957119. The cubic root of 110006417 is about 479.1513026588.
Adding to 110006417 its reverse (714600011), we get a palindrome (824606428).
The spelling of 110006417 in words is "one hundred ten million, six thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •