Base | Representation |
---|---|
bin | 1101010111110… |
… | …01000101000001 |
3 | 21211001210022211 |
4 | 12223321011001 |
5 | 212203404111 |
6 | 15044102121 |
7 | 2531265100 |
oct | 653710501 |
9 | 254053284 |
10 | 112169281 |
11 | 58353494 |
12 | 31694941 |
13 | 1a314873 |
14 | 10c7c037 |
15 | 9caa521 |
hex | 6af9141 |
112169281 has 27 divisors (see below), whose sum is σ = 140184489. Its totient is φ = 89472768.
The previous prime is 112169269. The next prime is 112169297. The reversal of 112169281 is 182961211.
It is a happy number.
The square root of 112169281 is 10591.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 148225 + 112021056 = 385^2 + 10584^2 .
It is not a de Polignac number, because 112169281 - 219 = 111644993 is a prime.
It is a super-2 number, since 2×1121692812 = 25163895200113922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112169201) 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 in 26 ways as a sum of consecutive naturals, for example, 1260285 + ... + 1260373.
Almost surely, 2112169281 is an apocalyptic number.
112169281 is the 10591-st square number.
112169281 is the 5296-th centered octagonal number.
It is an amenable number.
112169281 is a deficient number, since it is larger than the sum of its proper divisors (28015208).
112169281 is an frugal number, since it uses more digits than its factorization.
112169281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226 (or 113 counting only the distinct ones).
The product of its digits is 1728, while the sum is 31.
The cubic root of 112169281 is about 482.2711825457.
The spelling of 112169281 in words is "one hundred twelve million, one hundred sixty-nine thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •