Base | Representation |
---|---|
bin | 11011010101010010011001… |
… | …100100010011101000101110 |
3 | 120202121222100000201111010221 |
4 | 123111102121210103220232 |
5 | 111224010312001041420 |
6 | 1103355433421321554 |
7 | 34214615602155511 |
oct | 3325223144235056 |
9 | 522558300644127 |
10 | 120210121112110 |
11 | 3533690a550777 |
12 | 1159563a4062ba |
13 | 520c9c555c483 |
14 | 21982b53dcd78 |
15 | dd6e1b40ccaa |
hex | 6d5499913a2e |
120210121112110 has 64 divisors (see below), whose sum is σ = 230042795088384. Its totient is φ = 45070767616000.
The previous prime is 120210121112071. The next prime is 120210121112129. The reversal of 120210121112110 is 11211121012021.
120210121112110 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 pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 90148899 + ... + 91472641.
It is an arithmetic number, because the mean of its divisors is an integer number (3594418673256).
Almost surely, 2120210121112110 is an apocalyptic number.
120210121112110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120210121112110 is a deficient number, since it is larger than the sum of its proper divisors (109832673976274).
120210121112110 is a wasteful number, since it uses less digits than its factorization.
120210121112110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1325949.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 120210121112110 its reverse (11211121012021), we get a palindrome (131421242124131).
The spelling of 120210121112110 in words is "one hundred twenty trillion, two hundred ten billion, one hundred twenty-one million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •