Base | Representation |
---|---|
bin | 11110101110111101101… |
… | …110011100011000000010 |
3 | 21110220110202012120120110 |
4 | 132232331232130120002 |
5 | 234100400033323020 |
6 | 4254124523052150 |
7 | 305405424613566 |
oct | 36567556343002 |
9 | 7426422176513 |
10 | 2112012011010 |
11 | 7447767a1610 |
12 | 2a13a4671056 |
13 | 124214852625 |
14 | 74316d776a6 |
15 | 39e11a5b8e0 |
hex | 1ebbdb9c602 |
2112012011010 has 256 divisors, whose sum is σ = 5803125866496. Its totient is φ = 487296000000.
The previous prime is 2112012010973. The next prime is 2112012011069. The reversal of 2112012011010 is 101102102112.
It is a super-2 number, since 2×21120120110102 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
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 127 ways as a sum of consecutive naturals, for example, 156010962 + ... + 156024498.
It is an arithmetic number, because the mean of its divisors is an integer number (22668460416).
Almost surely, 22112012011010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2112012011010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2901562933248).
2112012011010 is an abundant number, since it is smaller than the sum of its proper divisors (3691113855486).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2112012011010 is a wasteful number, since it uses less digits than its factorization.
2112012011010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13841.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2112012011010 its reverse (101102102112), we get a palindrome (2213114113122).
The spelling of 2112012011010 in words is "two trillion, one hundred twelve billion, twelve million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •