Base | Representation |
---|---|
bin | 11101010001001100110… |
… | …011101001011011111100 |
3 | 21010021121021110020121110 |
4 | 131101030303221123330 |
5 | 230423202311131022 |
6 | 4135554353002020 |
7 | 265212466660626 |
oct | 35211463513374 |
9 | 7107537406543 |
10 | 2011333302012 |
11 | 706002239391 |
12 | 285987553310 |
13 | 11788b549738 |
14 | 6d4c5b21c16 |
15 | 374bce5800c |
hex | 1d44cce96fc |
2011333302012 has 48 divisors (see below), whose sum is σ = 4708244772000. Its totient is φ = 668285829120.
The previous prime is 2011333301969. The next prime is 2011333302019. The reversal of 2011333302012 is 2102033331102.
It is a self number, because there is not a number n which added to its sum of digits gives 2011333302012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011333302019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4598614 + ... + 5016962.
It is an arithmetic number, because the mean of its divisors is an integer number (98088432750).
Almost surely, 22011333302012 is an apocalyptic number.
It is an amenable number.
2011333302012 is an abundant number, since it is smaller than the sum of its proper divisors (2696911469988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011333302012 is a wasteful number, since it uses less digits than its factorization.
2011333302012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 419646 (or 419644 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 2011333302012 its reverse (2102033331102), we get a palindrome (4113366633114).
The spelling of 2011333302012 in words is "two trillion, eleven billion, three hundred thirty-three million, three hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •