Base | Representation |
---|---|
bin | 1101010110100… |
… | …00011111000011 |
3 | 21210202100020200 |
4 | 12223100133003 |
5 | 212133044021 |
6 | 15040340243 |
7 | 2530003251 |
oct | 653203703 |
9 | 253670220 |
10 | 112003011 |
11 | 5824a57a |
12 | 31614683 |
13 | 1a286c93 |
14 | 10c375d1 |
15 | 9c76126 |
hex | 6ad07c3 |
112003011 has 12 divisors (see below), whose sum is σ = 162369792. Its totient is φ = 74397456.
The previous prime is 112003009. The next prime is 112003013. The reversal of 112003011 is 110300211.
It is an interprime number because it is at equal distance from previous prime (112003009) and next prime (112003013).
It is not a de Polignac number, because 112003011 - 21 = 112003009 is a prime.
It is a super-2 number, since 2×1120030112 = 25089348946132242, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 112002984 and 112003002.
It is not an unprimeable number, because it can be changed into a prime (112003013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19971 + ... + 24956.
It is an arithmetic number, because the mean of its divisors is an integer number (13530816).
Almost surely, 2112003011 is an apocalyptic number.
112003011 is a deficient number, since it is larger than the sum of its proper divisors (50366781).
112003011 is a wasteful number, since it uses less digits than its factorization.
112003011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45210 (or 45207 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 112003011 is about 10583.1474996808. The cubic root of 112003011 is about 482.0327724025.
Adding to 112003011 its reverse (110300211), we get a palindrome (222303222).
The spelling of 112003011 in words is "one hundred twelve million, three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •