Base | Representation |
---|---|
bin | 1101011011001… |
… | …01000001010100 |
3 | 21211220020211001 |
4 | 12231211001110 |
5 | 212312031122 |
6 | 15101353044 |
7 | 2535116104 |
oct | 655450124 |
9 | 254806731 |
10 | 112611412 |
11 | 58625691 |
12 | 31868784 |
13 | 1a43ab94 |
14 | 10d55204 |
15 | 9d46527 |
hex | 6b65054 |
112611412 has 24 divisors (see below), whose sum is σ = 202860000. Its totient is φ = 54674976.
The previous prime is 112611403. The next prime is 112611439. The reversal of 112611412 is 214116211.
112611412 is digitally balanced in base 9, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1126114122 = 25362660225267488, which contains 22 as substring.
112611412 is strictly pandigital in base 9.
It is a self number, because there is not a number n which added to its sum of digits gives 112611412.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16714 + ... + 22462.
It is an arithmetic number, because the mean of its divisors is an integer number (8452500).
Almost surely, 2112611412 is an apocalyptic number.
It is an amenable number.
112611412 is a deficient number, since it is larger than the sum of its proper divisors (90248588).
112611412 is a wasteful number, since it uses less digits than its factorization.
112611412 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5895 (or 5893 counting only the distinct ones).
The product of its digits is 96, while the sum is 19.
The square root of 112611412 is about 10611.8524301839. The cubic root of 112611412 is about 482.9039983975.
Adding to 112611412 its reverse (214116211), we get a palindrome (326727623).
It can be divided in two parts, 112 and 611412, that added together give a square (611524 = 7822).
The spelling of 112611412 in words is "one hundred twelve million, six hundred eleven thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •