Base | Representation |
---|---|
bin | 100000110010000… |
… | …1011001101000001 |
3 | 2211122211220020000 |
4 | 1001210023031001 |
5 | 4223100031423 |
6 | 301052510213 |
7 | 36154602150 |
oct | 10144131501 |
9 | 2748756200 |
10 | 1100002113 |
11 | 514a16961 |
12 | 26847b369 |
13 | 146b81932 |
14 | a613d597 |
15 | 66886843 |
hex | 4190b341 |
1100002113 has 40 divisors (see below), whose sum is σ = 1889365632. Its totient is φ = 624754944.
The previous prime is 1100002097. The next prime is 1100002129. The reversal of 1100002113 is 3112000011.
It is an interprime number because it is at equal distance from previous prime (1100002097) and next prime (1100002129).
It is not a de Polignac number, because 1100002113 - 24 = 1100002097 is a prime.
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 = 1100002095 and 1100002104.
It is not an unprimeable number, because it can be changed into a prime (1100002513) 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 in 39 ways as a sum of consecutive naturals, for example, 88881 + ... + 100497.
Almost surely, 21100002113 is an apocalyptic number.
It is an amenable number.
1100002113 is a deficient number, since it is larger than the sum of its proper divisors (789363519).
1100002113 is a wasteful number, since it uses less digits than its factorization.
1100002113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11803 (or 11794 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 1100002113 is about 33166.2797582123. The cubic root of 1100002113 is about 1032.2807764280.
Adding to 1100002113 its reverse (3112000011), we get a palindrome (4212002124).
The spelling of 1100002113 in words is "one billion, one hundred million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •