Base | Representation |
---|---|
bin | 11101010001001010111… |
… | …000011011111100010111 |
3 | 21010021112000200021201220 |
4 | 131101022320123330113 |
5 | 230423121024044111 |
6 | 4135551240421423 |
7 | 265211625305535 |
oct | 35211270337427 |
9 | 7107460607656 |
10 | 2011301003031 |
11 | 705a95a88711 |
12 | 285978777873 |
13 | 11788494b208 |
14 | 6d4c1715155 |
15 | 374ba1c7e06 |
hex | 1d44ae1bf17 |
2011301003031 has 32 divisors (see below), whose sum is σ = 2846037841920. Its totient is φ = 1260707732064.
The previous prime is 2011301003021. The next prime is 2011301003057. The reversal of 2011301003031 is 1303001031102.
It is not a de Polignac number, because 2011301003031 - 223 = 2011292614423 is a prime.
It is a super-2 number, since 2×20113010030312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2011301003031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011301003021) 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 31 ways as a sum of consecutive naturals, for example, 60734980 + ... + 60768086.
It is an arithmetic number, because the mean of its divisors is an integer number (88938682560).
Almost surely, 22011301003031 is an apocalyptic number.
2011301003031 is a deficient number, since it is larger than the sum of its proper divisors (834736838889).
2011301003031 is a wasteful number, since it uses less digits than its factorization.
2011301003031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48115.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 2011301003031 its reverse (1303001031102), we get a palindrome (3314302034133).
The spelling of 2011301003031 in words is "two trillion, eleven billion, three hundred one million, three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •