Base | Representation |
---|---|
bin | 1001001001010101100001… |
… | …00111011110111000100000 |
3 | 2122012200120212021000200122 |
4 | 10210222300213132320200 |
5 | 10114003334001120000 |
6 | 110435154131135412 |
7 | 4144021052336300 |
oct | 444526047367040 |
9 | 78180525230618 |
10 | 20112000020000 |
11 | 64544a6768839 |
12 | 2309a10144568 |
13 | b2b726c64115 |
14 | 4d75d6d03600 |
15 | 24d25c847085 |
hex | 124ab09dee20 |
20112000020000 has 180 divisors, whose sum is σ = 57556668118950. Its totient is φ = 6895542528000.
The previous prime is 20112000019981. The next prime is 20112000020011. The reversal of 20112000020000 is 2000021102.
It can be written as a sum of positive squares in 5 ways, for example, as 1542554064016 + 18569445955984 = 1241996^2 + 4309228^2 .
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a self number, because there is not a number n which added to its sum of digits gives 20112000020000.
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 9281225 + ... + 11241224.
Almost surely, 220112000020000 is an apocalyptic number.
20112000020000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20112000020000 is an abundant number, since it is smaller than the sum of its proper divisors (37444668098950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20112000020000 is an equidigital number, since it uses as much as digits as its factorization.
20112000020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20522493 (or 20522463 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 20112000020000 its reverse (2000021102), we get a palindrome (20114000041102).
The spelling of 20112000020000 in words is "twenty trillion, one hundred twelve billion, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •