Base | Representation |
---|---|
bin | 1101011011010… |
… | …00110101111101 |
3 | 21211221001021221 |
4 | 12231220311331 |
5 | 212313031234 |
6 | 15101553341 |
7 | 2535212542 |
oct | 655506575 |
9 | 254831257 |
10 | 112627069 |
11 | 58636425 |
12 | 31875851 |
13 | 1a445049 |
14 | 10d5abc9 |
15 | 9d4aeb4 |
hex | 6b68d7d |
112627069 has 4 divisors (see below), whose sum is σ = 113249500. Its totient is φ = 112004640.
The previous prime is 112627063. The next prime is 112627093. The reversal of 112627069 is 960726211.
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 4571044 + 108056025 = 2138^2 + 10395^2 .
It is a cyclic number.
It is not a de Polignac number, because 112627069 - 215 = 112594301 is a prime.
It is a super-2 number, since 2×1126270692 = 25369713343061522, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112627063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 310944 + ... + 311305.
It is an arithmetic number, because the mean of its divisors is an integer number (28312375).
Almost surely, 2112627069 is an apocalyptic number.
It is an amenable number.
112627069 is a deficient number, since it is larger than the sum of its proper divisors (622431).
112627069 is an equidigital number, since it uses as much as digits as its factorization.
112627069 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 622430.
The product of its (nonzero) digits is 9072, while the sum is 34.
The square root of 112627069 is about 10612.5901174030. The cubic root of 112627069 is about 482.9263776495.
The spelling of 112627069 in words is "one hundred twelve million, six hundred twenty-seven thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •