Base | Representation |
---|---|
bin | 11101010001110101001… |
… | …001011110000000011000 |
3 | 21010100100102222201000000 |
4 | 131101311021132000120 |
5 | 230431044042023000 |
6 | 4140145451213000 |
7 | 265235325522651 |
oct | 35216511360030 |
9 | 7110312881000 |
10 | 2012010111000 |
11 | 70631a288a5a |
12 | 285b36147160 |
13 | 117968829126 |
14 | 6d54b980528 |
15 | 3750c599000 |
hex | 1d47525e018 |
2012010111000 has 896 divisors, whose sum is σ = 7688205720000. Its totient is φ = 490671820800.
The previous prime is 2012010110989. The next prime is 2012010111037. The reversal of 2012010111000 is 1110102102.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 223 ways as a sum of consecutive naturals, for example, 401676496 + ... + 401681504.
Almost surely, 22012010111000 is an apocalyptic number.
2012010111000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2012010111000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3844102860000).
2012010111000 is an abundant number, since it is smaller than the sum of its proper divisors (5676195609000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2012010111000 is a wasteful number, since it uses less digits than its factorization.
2012010111000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5096 (or 5067 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 2012010111000 its reverse (1110102102), we get a palindrome (2013120213102).
The spelling of 2012010111000 in words is "two trillion, twelve billion, ten million, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •