Base | Representation |
---|---|
bin | 1001001001010001110010… |
… | …11010000001001111010000 |
3 | 2122012111102110212120202220 |
4 | 10210220321122001033100 |
5 | 10113440240000031000 |
6 | 110434223443541040 |
7 | 4143620355431106 |
oct | 444507132011720 |
9 | 78174373776686 |
10 | 20110000002000 |
11 | 645366a8096a7 |
12 | 230955238a780 |
13 | b2b4987b180c |
14 | 4d7487441c76 |
15 | 24d191e7e1a0 |
hex | 124a396813d0 |
20110000002000 has 160 divisors (see below), whose sum is σ = 65045833716864. Its totient is φ = 5345198208000.
The previous prime is 20110000001977. The next prime is 20110000002019. The reversal of 20110000002000 is 20000001102.
It is a happy number.
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 self number, because there is not a number n which added to its sum of digits gives 20110000002000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3616741 + ... + 7300740.
Almost surely, 220110000002000 is an apocalyptic number.
20110000002000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20110000002000 is an abundant number, since it is smaller than the sum of its proper divisors (44935833714864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110000002000 is a wasteful number, since it uses less digits than its factorization.
20110000002000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10917814 (or 10917798 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 20110000002000 its reverse (20000001102), we get a palindrome (20130000003102).
The spelling of 20110000002000 in words is "twenty trillion, one hundred ten billion, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •