Base | Representation |
---|---|
bin | 11101000110101001111… |
… | …000101110000111011100 |
3 | 21002012101010200110121120 |
4 | 131012221320232013130 |
5 | 230232010030323400 |
6 | 4130443015330540 |
7 | 264332053411653 |
oct | 35065170560734 |
9 | 7065333613546 |
10 | 2000010011100 |
11 | 701221569322 |
12 | 283747380a50 |
13 | 1167a565acba |
14 | 6cb2dd3819a |
15 | 37058d08ca0 |
hex | 1d1a9e2e1dc |
2000010011100 has 72 divisors (see below), whose sum is σ = 5788841990400. Its totient is φ = 533138182080.
The previous prime is 2000010011081. The next prime is 2000010011107. The reversal of 2000010011100 is 11100100002.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000010011107) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 425332 + ... + 2044731.
It is an arithmetic number, because the mean of its divisors is an integer number (80400583200).
Almost surely, 22000010011100 is an apocalyptic number.
2000010011100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2000010011100 is an abundant number, since it is smaller than the sum of its proper divisors (3788831979300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000010011100 is a wasteful number, since it uses less digits than its factorization.
2000010011100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2472779 (or 2472772 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 2000010011100 its reverse (11100100002), we get a palindrome (2011110111102).
The spelling of 2000010011100 in words is "two trillion, ten million, eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •