Base | Representation |
---|---|
bin | 110111111011100111… |
… | …1101110000001011010 |
3 | 102111000211022110200202 |
4 | 1233313033232001122 |
5 | 3431442211210020 |
6 | 131102341302202 |
7 | 11451330640202 |
oct | 1576717560132 |
9 | 374024273622 |
10 | 120112210010 |
11 | 46a37236171 |
12 | 1b341404962 |
13 | b432514620 |
14 | 5b561d5402 |
15 | 31cec6ce75 |
hex | 1bf73ee05a |
120112210010 has 64 divisors (see below), whose sum is σ = 233872531200. Its totient is φ = 44151582720.
The previous prime is 120112209967. The next prime is 120112210019. The reversal of 120112210010 is 10012211021.
It is a junction number, because it is equal to n+sod(n) for n = 120112209973 and 120112210000.
It is not an unprimeable number, because it can be changed into a prime (120112210019) by changing a digit.
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, 29358065 + ... + 29362155.
It is an arithmetic number, because the mean of its divisors is an integer number (3654258300).
Almost surely, 2120112210010 is an apocalyptic number.
120112210010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120112210010 is a deficient number, since it is larger than the sum of its proper divisors (113760321190).
120112210010 is a wasteful number, since it uses less digits than its factorization.
120112210010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5063.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 120112210010 its reverse (10012211021), we get a palindrome (130124421031).
The spelling of 120112210010 in words is "one hundred twenty billion, one hundred twelve million, two hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.169 sec. • engine limits •