Base | Representation |
---|---|
bin | 101101111110100010101111… |
… | …010010101111001000011000 |
3 | 222111222002100122211012211220 |
4 | 231332202233102233020120 |
5 | 203001002040303020440 |
6 | 1554021554145252040 |
7 | 60410122222612665 |
oct | 5576425722571030 |
9 | 874862318735756 |
10 | 202210001220120 |
11 | 594808640a3003 |
12 | 1a8197a0334020 |
13 | 88aa423b6903a |
14 | 37d1032954a6c |
15 | 1859e2d5408d0 |
hex | b7e8af4af218 |
202210001220120 has 32 divisors (see below), whose sum is σ = 606630003660720. Its totient is φ = 53922666992000.
The previous prime is 202210001220119. The next prime is 202210001220151. The reversal of 202210001220120 is 21022100012202.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 202210001220120.
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, 842541671631 + ... + 842541671870.
Almost surely, 2202210001220120 is an apocalyptic number.
202210001220120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202210001220120 is an abundant number, since it is smaller than the sum of its proper divisors (404420002440600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202210001220120 is a wasteful number, since it uses less digits than its factorization.
202210001220120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1685083343515 (or 1685083343511 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 202210001220120 its reverse (21022100012202), we get a palindrome (223232101232322).
The spelling of 202210001220120 in words is "two hundred two trillion, two hundred ten billion, one million, two hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •