Base | Representation |
---|---|
bin | 111011101000110… |
… | …1101111000111001 |
3 | 12011110111002120020 |
4 | 1313101231320321 |
5 | 13044242224423 |
6 | 530323121053 |
7 | 100406231220 |
oct | 16721557071 |
9 | 5143432506 |
10 | 2001133113 |
11 | 937650a21 |
12 | 47a213189 |
13 | 25b783045 |
14 | 14dab1cb7 |
15 | baa384e3 |
hex | 7746de39 |
2001133113 has 8 divisors (see below), whose sum is σ = 3049345728. Its totient is φ = 1143504624.
The previous prime is 2001133103. The next prime is 2001133117. The reversal of 2001133113 is 3113311002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2001133113 - 225 = 1967578681 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2001133092 and 2001133101.
It is not an unprimeable number, because it can be changed into a prime (2001133117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47646006 + ... + 47646047.
It is an arithmetic number, because the mean of its divisors is an integer number (381168216).
Almost surely, 22001133113 is an apocalyptic number.
It is an amenable number.
2001133113 is a deficient number, since it is larger than the sum of its proper divisors (1048212615).
2001133113 is an equidigital number, since it uses as much as digits as its factorization.
2001133113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95292063.
The product of its (nonzero) digits is 54, while the sum is 15.
The square root of 2001133113 is about 44734.0263446071. The cubic root of 2001133113 is about 1260.1589437939.
Adding to 2001133113 its reverse (3113311002), we get a palindrome (5114444115).
The spelling of 2001133113 in words is "two billion, one million, one hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •