Base | Representation |
---|---|
bin | 11101010000111001101… |
… | …010001000010111000011 |
3 | 21010020202212221110011021 |
4 | 131100321222020113003 |
5 | 230422023040241011 |
6 | 4135502435130311 |
7 | 265201516205233 |
oct | 35207152102703 |
9 | 7106685843137 |
10 | 2011012040131 |
11 | 7059579625a6 |
12 | 2858b7a43997 |
13 | 117839b16053 |
14 | 6d4951b5cc3 |
15 | 3749eb49471 |
hex | 1d439a885c3 |
2011012040131 has 4 divisors (see below), whose sum is σ = 2012527498912. Its totient is φ = 2009496581352.
The previous prime is 2011012040119. The next prime is 2011012040153. The reversal of 2011012040131 is 1310402101102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2011012040131 - 27 = 2011012040003 is a prime.
It is a super-2 number, since 2×20110120401312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2011012040101) 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 3 ways as a sum of consecutive naturals, for example, 757727400 + ... + 757730053.
It is an arithmetic number, because the mean of its divisors is an integer number (503131874728).
Almost surely, 22011012040131 is an apocalyptic number.
2011012040131 is a deficient number, since it is larger than the sum of its proper divisors (1515458781).
2011012040131 is a wasteful number, since it uses less digits than its factorization.
2011012040131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1515458780.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 2011012040131 its reverse (1310402101102), we get a palindrome (3321414141233).
The spelling of 2011012040131 in words is "two trillion, eleven billion, twelve million, forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •