Base | Representation |
---|---|
bin | 1001001100010001101011… |
… | …11011111110110010110000 |
3 | 2122120100100012002002110021 |
4 | 10212020311323332302300 |
5 | 10122132231334323440 |
6 | 110553422245413224 |
7 | 4154225334523300 |
oct | 446106573766260 |
9 | 78510305062407 |
10 | 20213021011120 |
11 | 6493326454653 |
12 | 2325503a0a214 |
13 | b38106150302 |
14 | 4dc45b7b7600 |
15 | 250bc150c84a |
hex | 126235efecb0 |
20213021011120 has 60 divisors (see below), whose sum is σ = 54667971633024. Its totient is φ = 6930178631040.
The previous prime is 20213021011067. The next prime is 20213021011123. The reversal of 20213021011120 is 2111012031202.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 20213021011094 and 20213021011103.
It is not an unprimeable number, because it can be changed into a prime (20213021011123) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2578187536 + ... + 2578195375.
Almost surely, 220213021011120 is an apocalyptic number.
20213021011120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20213021011120 is an abundant number, since it is smaller than the sum of its proper divisors (34454950621904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20213021011120 is a wasteful number, since it uses less digits than its factorization.
20213021011120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5156382938 (or 5156382925 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 20213021011120 its reverse (2111012031202), we get a palindrome (22324033042322).
The spelling of 20213021011120 in words is "twenty trillion, two hundred thirteen billion, twenty-one million, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •