Base | Representation |
---|---|
bin | 1101001100000… |
… | …11101001000001 |
3 | 21201012002002222 |
4 | 12212003221001 |
5 | 211310432211 |
6 | 14551220425 |
7 | 2512264445 |
oct | 646035101 |
9 | 251162088 |
10 | 110639681 |
11 | 574a9259 |
12 | 31077715 |
13 | 19bca589 |
14 | 109a0825 |
15 | 9aa71db |
hex | 6983a41 |
110639681 has 2 divisors, whose sum is σ = 110639682. Its totient is φ = 110639680.
The previous prime is 110639677. The next prime is 110639701. The reversal of 110639681 is 186936011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82719025 + 27920656 = 9095^2 + 5284^2 .
It is a cyclic number.
It is not a de Polignac number, because 110639681 - 22 = 110639677 is a prime.
It is a super-2 number, since 2×1106396812 = 24482278023563522, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (110639381) 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, 55319840 + 55319841.
It is an arithmetic number, because the mean of its divisors is an integer number (55319841).
Almost surely, 2110639681 is an apocalyptic number.
It is an amenable number.
110639681 is a deficient number, since it is larger than the sum of its proper divisors (1).
110639681 is an equidigital number, since it uses as much as digits as its factorization.
110639681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 35.
The square root of 110639681 is about 10518.5398701531. The cubic root of 110639681 is about 480.0689730168.
The spelling of 110639681 in words is "one hundred ten million, six hundred thirty-nine thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •