Base | Representation |
---|---|
bin | 101101101101001111100101… |
… | …110100001100110101100100 |
3 | 222100202102212202110012100221 |
4 | 231231033211310030311210 |
5 | 202322012414231134340 |
6 | 1551311511412214124 |
7 | 60225205660264231 |
oct | 5555174564146544 |
9 | 870672782405327 |
10 | 201021210021220 |
11 | 590626864990a6 |
12 | 1a66731060a344 |
13 | 88222ac824c24 |
14 | 378d69ad30788 |
15 | 18390528db44a |
hex | b6d3e5d0cd64 |
201021210021220 has 48 divisors (see below), whose sum is σ = 423979009534080. Its totient is φ = 80059098381056.
The previous prime is 201021210021197. The next prime is 201021210021319. The reversal of 201021210021220 is 22120012120102.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 201021210021194 and 201021210021203.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 86644839 + ... + 88934641.
It is an arithmetic number, because the mean of its divisors is an integer number (8832896031960).
Almost surely, 2201021210021220 is an apocalyptic number.
201021210021220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201021210021220 is an abundant number, since it is smaller than the sum of its proper divisors (222957799512860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201021210021220 is a wasteful number, since it uses less digits than its factorization.
201021210021220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2308884 (or 2308882 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201021210021220 its reverse (22120012120102), we get a palindrome (223141222141322).
The spelling of 201021210021220 in words is "two hundred one trillion, twenty-one billion, two hundred ten million, twenty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •