Base | Representation |
---|---|
bin | 11101010000111001101… |
… | …010001101011111000011 |
3 | 21010020202212222111221202 |
4 | 131100321222031133003 |
5 | 230422023041423443 |
6 | 4135502435411415 |
7 | 265201516323362 |
oct | 35207152153703 |
9 | 7106685874852 |
10 | 2011012061123 |
11 | 70595797734a |
12 | 2858b7a53b6b |
13 | 117839b22780 |
14 | 6d4951bd7d9 |
15 | 3749eb507b8 |
hex | 1d439a8d7c3 |
2011012061123 has 8 divisors (see below), whose sum is σ = 2240384790000. Its totient is φ = 1792307831328.
The previous prime is 2011012061081. The next prime is 2011012061143. The reversal of 2011012061123 is 3211602101102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2011012061123 - 28 = 2011012060867 is a prime.
It is a super-2 number, since 2×20110120611232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011012061095 and 2011012061104.
It is not an unprimeable number, because it can be changed into a prime (2011012061143) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2667124373 + ... + 2667125126.
It is an arithmetic number, because the mean of its divisors is an integer number (280048098750).
Almost surely, 22011012061123 is an apocalyptic number.
2011012061123 is a deficient number, since it is larger than the sum of its proper divisors (229372728877).
2011012061123 is a wasteful number, since it uses less digits than its factorization.
2011012061123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5334249541.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 2011012061123 its reverse (3211602101102), we get a palindrome (5222614162225).
The spelling of 2011012061123 in words is "two trillion, eleven billion, twelve million, sixty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •