Base | Representation |
---|---|
bin | 101101110000001000101111… |
… | …110111111110100111000000 |
3 | 222101110110001020102102100121 |
4 | 231300020233313332213000 |
5 | 202333242100340133440 |
6 | 1551543111310030024 |
7 | 60245444463015523 |
oct | 5560105767764700 |
9 | 871413036372317 |
10 | 201220021021120 |
11 | 59129a28086992 |
12 | 1a699955aa8314 |
13 | 8837c7470163a |
14 | 379915b146bba |
15 | 183e2db79934a |
hex | b7022fdfe9c0 |
201220021021120 has 56 divisors (see below), whose sum is σ = 479167027885008. Its totient is φ = 80486017382400.
The previous prime is 201220021021087. The next prime is 201220021021157. The reversal of 201220021021120 is 21120120022102.
It is a happy number.
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 = 201220021021094 and 201220021021103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5212740 + ... + 20727100.
Almost surely, 2201220021021120 is an apocalyptic number.
201220021021120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201220021021120 is an abundant number, since it is smaller than the sum of its proper divisors (277947006863888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201220021021120 is a wasteful number, since it uses less digits than its factorization.
201220021021120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15554909 (or 15554899 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201220021021120 its reverse (21120120022102), we get a palindrome (222340141043222).
The spelling of 201220021021120 in words is "two hundred one trillion, two hundred twenty billion, twenty-one million, twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •