Base | Representation |
---|---|
bin | 1101011110000… |
… | …10010010100101 |
3 | 21212121122212102 |
4 | 12233002102211 |
5 | 212411242240 |
6 | 15113501445 |
7 | 2541266645 |
oct | 657022245 |
9 | 255548772 |
10 | 112993445 |
11 | 58866714 |
12 | 31a11885 |
13 | 1a542a36 |
14 | 11014525 |
15 | 9dbe815 |
hex | 6bc24a5 |
112993445 has 4 divisors (see below), whose sum is σ = 135592140. Its totient is φ = 90394752.
The previous prime is 112993429. The next prime is 112993501. The reversal of 112993445 is 544399211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 28922884 + 84070561 = 5378^2 + 9169^2 .
It is a cyclic number.
It is not a de Polignac number, because 112993445 - 24 = 112993429 is a prime.
It is a super-2 number, since 2×1129934452 = 25535037225936050, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112993399 and 112993408.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 11299340 + ... + 11299349.
It is an arithmetic number, because the mean of its divisors is an integer number (33898035).
Almost surely, 2112993445 is an apocalyptic number.
It is an amenable number.
112993445 is a deficient number, since it is larger than the sum of its proper divisors (22598695).
112993445 is an equidigital number, since it uses as much as digits as its factorization.
112993445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22598694.
The product of its digits is 38880, while the sum is 38.
The square root of 112993445 is about 10629.8374869986. The cubic root of 112993445 is about 483.4494642339.
The spelling of 112993445 in words is "one hundred twelve million, nine hundred ninety-three thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •