Base | Representation |
---|---|
bin | 1101001100100… |
… | …00010001110001 |
3 | 21201021201010000 |
4 | 12212100101301 |
5 | 211314111231 |
6 | 14552300213 |
7 | 2512601400 |
oct | 646202161 |
9 | 251251100 |
10 | 110691441 |
11 | 57534133 |
12 | 310a1669 |
13 | 19c17cc3 |
14 | 109b5637 |
15 | 9ab76e6 |
hex | 6990471 |
110691441 has 45 divisors (see below), whose sum is σ = 193509129. Its totient is φ = 62873496.
The previous prime is 110691419. The next prime is 110691461. The reversal of 110691441 is 144196011.
The square root of 110691441 is 10521.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 110691441 - 217 = 110560369 is a prime.
It is a super-2 number, since 2×1106914412 = 24505190221312962, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (110691461) 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 in 44 ways as a sum of consecutive naturals, for example, 662740 + ... + 662906.
Almost surely, 2110691441 is an apocalyptic number.
110691441 is the 10521-st square number.
110691441 is the 5261-st centered octagonal number.
It is an amenable number.
110691441 is a deficient number, since it is larger than the sum of its proper divisors (82817688).
110691441 is an frugal number, since it uses more digits than its factorization.
110691441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 360 (or 177 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 27.
The cubic root of 110691441 is about 480.1438240887.
The spelling of 110691441 in words is "one hundred ten million, six hundred ninety-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •