Base | Representation |
---|---|
bin | 11101010000111001100… |
… | …010011011001010100010 |
3 | 21010020202202010211001200 |
4 | 131100321202123022202 |
5 | 230422022031120002 |
6 | 4135502323542030 |
7 | 265201463062524 |
oct | 35207142331242 |
9 | 7106682124050 |
10 | 2011010020002 |
11 | 705956802875 |
12 | 2858b722a916 |
13 | 1178395896c9 |
14 | 6d494c0ba14 |
15 | 3749e89ab1c |
hex | 1d43989b2a2 |
2011010020002 has 24 divisors (see below), whose sum is σ = 4412342663040. Its totient is φ = 661851398520.
The previous prime is 2011010020001. The next prime is 2011010020007. The reversal of 2011010020002 is 2000200101102.
It is a super-2 number, since 2×20110100200022 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (2011010020001) 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 11 ways as a sum of consecutive naturals, for example, 707104774 + ... + 707107617.
It is an arithmetic number, because the mean of its divisors is an integer number (183847610960).
Almost surely, 22011010020002 is an apocalyptic number.
2011010020002 is an abundant number, since it is smaller than the sum of its proper divisors (2401332643038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011010020002 is a wasteful number, since it uses less digits than its factorization.
2011010020002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1414212478 (or 1414212475 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 2011010020002 its reverse (2000200101102), we get a palindrome (4011210121104).
The spelling of 2011010020002 in words is "two trillion, eleven billion, ten million, twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •