Base | Representation |
---|---|
bin | 1001010010111000111010… |
… | …1000010001101100111000 |
3 | 1100012000220202001221101212 |
4 | 2110232032220101230320 |
5 | 2314421301222320440 |
6 | 33423020335102252 |
7 | 2103244050446531 |
oct | 224561650215470 |
9 | 40160822057355 |
10 | 10220120120120 |
11 | 3290368408269 |
12 | 1190889671988 |
13 | 5919a39bbb01 |
14 | 274929443688 |
15 | 12acae95e465 |
hex | 94b8ea11b38 |
10220120120120 has 32 divisors (see below), whose sum is σ = 23222946222720. Its totient is φ = 4047572323200.
The previous prime is 10220120120087. The next prime is 10220120120137. The reversal of 10220120120120 is 2102102102201.
It is a junction number, because it is equal to n+sod(n) for n = 10220120120095 and 10220120120104.
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, 1264862312 + ... + 1264870391.
It is an arithmetic number, because the mean of its divisors is an integer number (725717069460).
Almost surely, 210220120120120 is an apocalyptic number.
10220120120120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10220120120120 is an abundant number, since it is smaller than the sum of its proper divisors (13002826102600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10220120120120 is a wasteful number, since it uses less digits than its factorization.
10220120120120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2529732815 (or 2529732811 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10220120120120 its reverse (2102102102201), we get a palindrome (12322222222321).
The spelling of 10220120120120 in words is "ten trillion, two hundred twenty billion, one hundred twenty million, one hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •