Base | Representation |
---|---|
bin | 1101001100100… |
… | …00010001110010 |
3 | 21201021201010001 |
4 | 12212100101302 |
5 | 211314111232 |
6 | 14552300214 |
7 | 2512601401 |
oct | 646202162 |
9 | 251251101 |
10 | 110691442 |
11 | 57534134 |
12 | 310a166a |
13 | 19c17cc4 |
14 | 109b5638 |
15 | 9ab76e7 |
hex | 6990472 |
110691442 has 8 divisors (see below), whose sum is σ = 166683996. Its totient is φ = 55130112.
The previous prime is 110691419. The next prime is 110691461. The reversal of 110691442 is 244196011.
It is a Cunningham number, because it is equal to 105212+1.
It can be written as a sum of positive squares in 2 ways, for example, as 110691441 + 1 = 10521^2 + 1^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 110691442.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 107163 + ... + 108190.
Almost surely, 2110691442 is an apocalyptic number.
110691442 is a deficient number, since it is larger than the sum of its proper divisors (55992554).
110691442 is a wasteful number, since it uses less digits than its factorization.
110691442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215612.
The product of its (nonzero) digits is 1728, while the sum is 28.
The square root of 110691442 is about 10521.0000475240. Note that the first 4 decimals coincide. The cubic root of 110691442 is about 480.1438255346.
The spelling of 110691442 in words is "one hundred ten million, six hundred ninety-one thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •