Base | Representation |
---|---|
bin | 1001001001010011101011… |
… | …01010101101110110100000 |
3 | 2122012121000221021012202201 |
4 | 10210221311222231312200 |
5 | 10113444322304341000 |
6 | 110434512041222544 |
7 | 4143654413036116 |
oct | 444516552556640 |
9 | 78177027235681 |
10 | 20111011012000 |
11 | 6454039472457 |
12 | 2309794a91a54 |
13 | b2b5ca0a519c |
14 | 4d7541817ab6 |
15 | 24d200ad796a |
hex | 124a75aadda0 |
20111011012000 has 48 divisors (see below), whose sum is σ = 49412754066312. Its totient is φ = 8044404403200.
The previous prime is 20111011011997. The next prime is 20111011012009. The reversal of 20111011012000 is 21011011102.
It can be written as a sum of positive squares in 4 ways, for example, as 8637697488016 + 11473313523984 = 2938996^2 + 3387228^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (20111011012009) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2513872377 + ... + 2513880376.
Almost surely, 220111011012000 is an apocalyptic number.
20111011012000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20111011012000 is an abundant number, since it is smaller than the sum of its proper divisors (29301743054312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111011012000 is an equidigital number, since it uses as much as digits as its factorization.
20111011012000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5027752778 (or 5027752760 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 20111011012000 its reverse (21011011102), we get a palindrome (20132022023102).
The spelling of 20111011012000 in words is "twenty trillion, one hundred eleven billion, eleven million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •