Base | Representation |
---|---|
bin | 11011010101111010011101… |
… | …101100110011100111111110 |
3 | 120202210002101002120121210121 |
4 | 123111322131230303213332 |
5 | 111230211412332401420 |
6 | 1103431310244125154 |
7 | 34221000625545652 |
oct | 3325723554634776 |
9 | 522702332517717 |
10 | 120253140122110 |
11 | 353530856736a6 |
12 | 115a1a453967ba |
13 | 5213a8cc20b88 |
14 | 219a3d6920a62 |
15 | dd80d7e912aa |
hex | 6d5e9db339fe |
120253140122110 has 32 divisors (see below), whose sum is σ = 229197025275840. Its totient is φ = 45270054323712.
The previous prime is 120253140122083. The next prime is 120253140122123. The reversal of 120253140122110 is 11221041352021.
120253140122110 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 (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8904445 + ... + 17882824.
It is an arithmetic number, because the mean of its divisors is an integer number (7162407039870).
Almost surely, 2120253140122110 is an apocalyptic number.
120253140122110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120253140122110 is a deficient number, since it is larger than the sum of its proper divisors (108943885153730).
120253140122110 is a wasteful number, since it uses less digits than its factorization.
120253140122110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26813700.
The product of its (nonzero) digits is 960, while the sum is 25.
Adding to 120253140122110 its reverse (11221041352021), we get a palindrome (131474181474131).
The spelling of 120253140122110 in words is "one hundred twenty trillion, two hundred fifty-three billion, one hundred forty million, one hundred twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •