Base | Representation |
---|---|
bin | 10011000001010001… |
… | …01101101010011000 |
3 | 222100122012201122210 |
4 | 21200220231222120 |
5 | 131403033020440 |
6 | 4405125515120 |
7 | 511020640023 |
oct | 114050555230 |
9 | 28318181583 |
10 | 10211220120 |
11 | 436aa708a2 |
12 | 1b8b872aa0 |
13 | c696a27aa |
14 | 6cc2261ba |
15 | 3eb6d1a80 |
hex | 260a2da98 |
10211220120 has 32 divisors (see below), whose sum is σ = 30633660720. Its totient is φ = 2722992000.
The previous prime is 10211220113. The next prime is 10211220127. The reversal of 10211220120 is 2102211201.
It is an interprime number because it is at equal distance from previous prime (10211220113) and next prime (10211220127).
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 = 10211220096 and 10211220105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211220127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42546631 + ... + 42546870.
Almost surely, 210211220120 is an apocalyptic number.
10211220120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10211220120 is an abundant number, since it is smaller than the sum of its proper divisors (20422440600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10211220120 is a wasteful number, since it uses less digits than its factorization.
10211220120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 85093515 (or 85093511 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10211220120 its reverse (2102211201), we get a palindrome (12313431321).
The spelling of 10211220120 in words is "ten billion, two hundred eleven million, two hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •