Base | Representation |
---|---|
bin | 11011010101001001001010… |
… | …111100111000100011001110 |
3 | 120202121000202110101121200221 |
4 | 123111021022330320203032 |
5 | 111223330013312020420 |
6 | 1103351114251341554 |
7 | 34214115212032531 |
oct | 3325111274704316 |
9 | 522530673347627 |
10 | 120200212220110 |
11 | 35332695204530 |
12 | 11593733a518ba |
13 | 520baa66c1379 |
14 | 2197a153d4a18 |
15 | dd6a3b549caa |
hex | 6d524af388ce |
120200212220110 has 64 divisors (see below), whose sum is σ = 249927381356544. Its totient is φ = 41135771404800.
The previous prime is 120200212220087. The next prime is 120200212220159. The reversal of 120200212220110 is 11022212002021.
It is a happy number.
120200212220110 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 32313355 + ... + 35840665.
It is an arithmetic number, because the mean of its divisors is an integer number (3905115333696).
Almost surely, 2120200212220110 is an apocalyptic number.
120200212220110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120200212220110 is an abundant number, since it is smaller than the sum of its proper divisors (129727169136434).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120200212220110 is a wasteful number, since it uses less digits than its factorization.
120200212220110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3545569.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 120200212220110 its reverse (11022212002021), we get a palindrome (131222424222131).
The spelling of 120200212220110 in words is "one hundred twenty trillion, two hundred billion, two hundred twelve million, two hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •