Base | Representation |
---|---|
bin | 100000001010001110010… |
… | …101001110101101111000 |
3 | 21211021101210000002002210 |
4 | 200022032111032231320 |
5 | 242202040241320440 |
6 | 4411132133455120 |
7 | 315444613400463 |
oct | 40121625165570 |
9 | 7737353002083 |
10 | 2210001120120 |
11 | 782290021612 |
12 | 2b8390aa14a0 |
13 | 13052c8737b1 |
14 | 78d70d062da |
15 | 3c749481a80 |
hex | 2028e54eb78 |
2210001120120 has 32 divisors (see below), whose sum is σ = 6630003360720. Its totient is φ = 589333632000.
The previous prime is 2210001120059. The next prime is 2210001120139. The reversal of 2210001120120 is 210211000122.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 2210001120096 and 2210001120105.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9208337881 + ... + 9208338120.
Almost surely, 22210001120120 is an apocalyptic number.
2210001120120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2210001120120 is an abundant number, since it is smaller than the sum of its proper divisors (4420002240600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2210001120120 is a wasteful number, since it uses less digits than its factorization.
2210001120120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18416676015 (or 18416676011 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2210001120120 its reverse (210211000122), we get a palindrome (2420212120242).
The spelling of 2210001120120 in words is "two trillion, two hundred ten billion, one million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •