Base | Representation |
---|---|
bin | 111011100110111… |
… | …0001101100010001 |
3 | 12011101112121112222 |
4 | 1313031301230101 |
5 | 13044011200423 |
6 | 530245030425 |
7 | 100364366444 |
oct | 16715615421 |
9 | 5141477488 |
10 | 2000100113 |
11 | 937005900 |
12 | 4799b5415 |
13 | 25b4b0abb |
14 | 14d8c365b |
15 | ba8d23c8 |
hex | 77371b11 |
2000100113 has 24 divisors (see below), whose sum is σ = 2334948000. Its totient is φ = 1707108480.
The previous prime is 2000100097. The next prime is 2000100131. The reversal of 2000100113 is 3110010002.
It is not a de Polignac number, because 2000100113 - 24 = 2000100097 is a prime.
It is a super-2 number, since 2×20001001132 = 8000800924045225538, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2000100113.
It is not an unprimeable number, because it can be changed into a prime (2000100143) 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 23 ways as a sum of consecutive naturals, for example, 255938 + ... + 263636.
It is an arithmetic number, because the mean of its divisors is an integer number (97289500).
Almost surely, 22000100113 is an apocalyptic number.
It is an amenable number.
2000100113 is a deficient number, since it is larger than the sum of its proper divisors (334847887).
2000100113 is a wasteful number, since it uses less digits than its factorization.
2000100113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7853 (or 7842 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 8.
The square root of 2000100113 is about 44722.4788333563. The cubic root of 2000100113 is about 1259.9420719568.
Adding to 2000100113 its reverse (3110010002), we get a palindrome (5110110115).
The spelling of 2000100113 in words is "two billion, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •