Base | Representation |
---|---|
bin | 101101111110101100001001… |
… | …110101000110010101111000 |
3 | 222112000001110011111010201022 |
4 | 231332230021311012111320 |
5 | 203001133241142041440 |
6 | 1554030345222042012 |
7 | 60410630562023222 |
oct | 5576541165062570 |
9 | 875001404433638 |
10 | 202220110112120 |
11 | 59485081322201 |
12 | 1a81b741879308 |
13 | 88ab375291439 |
14 | 37d1711341412 |
15 | 185a320c5ccb5 |
hex | b7eb09d46578 |
202220110112120 has 64 divisors (see below), whose sum is σ = 455175929545920. Its totient is φ = 80855925940224.
The previous prime is 202220110112117. The next prime is 202220110112129. The reversal of 202220110112120 is 21211011022202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202220110112129) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2934817589 + ... + 2934886491.
It is an arithmetic number, because the mean of its divisors is an integer number (7112123899155).
Almost surely, 2202220110112120 is an apocalyptic number.
202220110112120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202220110112120 is an abundant number, since it is smaller than the sum of its proper divisors (252955819433800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202220110112120 is a wasteful number, since it uses less digits than its factorization.
202220110112120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 96984 (or 96980 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 202220110112120 its reverse (21211011022202), we get a palindrome (223431121134322).
The spelling of 202220110112120 in words is "two hundred two trillion, two hundred twenty billion, one hundred ten million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •