Base | Representation |
---|---|
bin | 1101010110100… |
… | …00000000101101 |
3 | 21210202020120202 |
4 | 12223100000231 |
5 | 212133013234 |
6 | 15040323245 |
7 | 2526664505 |
oct | 653200055 |
9 | 253666522 |
10 | 112001069 |
11 | 58249074 |
12 | 31613525 |
13 | 1a28612b |
14 | 10c36a05 |
15 | 9c7577e |
hex | 6ad002d |
112001069 has 2 divisors, whose sum is σ = 112001070. Its totient is φ = 112001068.
The previous prime is 112001059. The next prime is 112001107. The reversal of 112001069 is 960100211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 89056969 + 22944100 = 9437^2 + 4790^2 .
It is a cyclic number.
It is not a de Polignac number, because 112001069 - 216 = 111935533 is a prime.
It is a super-2 number, since 2×1120010692 = 25088478914285522, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 112001069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112001039) 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 as a sum of consecutive naturals, namely, 56000534 + 56000535.
It is an arithmetic number, because the mean of its divisors is an integer number (56000535).
Almost surely, 2112001069 is an apocalyptic number.
It is an amenable number.
112001069 is a deficient number, since it is larger than the sum of its proper divisors (1).
112001069 is an equidigital number, since it uses as much as digits as its factorization.
112001069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
The square root of 112001069 is about 10583.0557496406. The cubic root of 112001069 is about 482.0299864266.
The spelling of 112001069 in words is "one hundred twelve million, one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •