Base | Representation |
---|---|
bin | 110111111011100100… |
… | …0000110010001111100 |
3 | 102111000200112222020112 |
4 | 1233313020012101330 |
5 | 3431441203242340 |
6 | 131102230405152 |
7 | 11451304646555 |
oct | 1576710062174 |
9 | 374020488215 |
10 | 120110212220 |
11 | 46a360a11a9 |
12 | 1b3408007b8 |
13 | b431c951bb |
14 | 5b55c3532c |
15 | 31ce9c6065 |
hex | 1bf720647c |
120110212220 has 48 divisors (see below), whose sum is σ = 263231313408. Its totient is φ = 45949400640.
The previous prime is 120110212193. The next prime is 120110212249. The reversal of 120110212220 is 22212011021.
120110212220 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 120110212195 and 120110212204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6028475 + ... + 6048365.
It is an arithmetic number, because the mean of its divisors is an integer number (5483985696).
Almost surely, 2120110212220 is an apocalyptic number.
120110212220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120110212220 is an abundant number, since it is smaller than the sum of its proper divisors (143121101188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120110212220 is a wasteful number, since it uses less digits than its factorization.
120110212220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33050 (or 33048 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 120110212220 its reverse (22212011021), we get a palindrome (142322223241).
The spelling of 120110212220 in words is "one hundred twenty billion, one hundred ten million, two hundred twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •