Base | Representation |
---|---|
bin | 1001000110011001100101… |
… | …01000000111111110100100 |
3 | 2121212001011002212010002110 |
4 | 10203030302220013332210 |
5 | 10110330214103330200 |
6 | 110320550124441020 |
7 | 4133516522404521 |
oct | 443146250077644 |
9 | 77761132763073 |
10 | 20011102011300 |
11 | 641572a440494 |
12 | 22b23516a9170 |
13 | b220673a74aa |
14 | 4d27848c4148 |
15 | 24a804875b50 |
hex | 123332a07fa4 |
20011102011300 has 144 divisors (see below), whose sum is σ = 60728805607680. Its totient is φ = 5081600010240.
The previous prime is 20011102011287. The next prime is 20011102011311. The reversal of 20011102011300 is 311020111002.
It is a super-3 number, since 3×200111020113003 (a number of 41 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18657045 + ... + 19700444.
It is an arithmetic number, because the mean of its divisors is an integer number (421727816720).
Almost surely, 220011102011300 is an apocalyptic number.
20011102011300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20011102011300 is an abundant number, since it is smaller than the sum of its proper divisors (40717703596380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20011102011300 is a wasteful number, since it uses less digits than its factorization.
20011102011300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38357590 (or 38357583 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 20011102011300 its reverse (311020111002), we get a palindrome (20322122122302).
The spelling of 20011102011300 in words is "twenty trillion, eleven billion, one hundred two million, eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •