Base | Representation |
---|---|
bin | 110111111011010010… |
… | …1110000101111100110 |
3 | 102111000001121200001002 |
4 | 1233312211300233212 |
5 | 3431431402223420 |
6 | 131101305433302 |
7 | 11451135310346 |
oct | 1576645605746 |
9 | 374001550032 |
10 | 120101211110 |
11 | 46a31003571 |
12 | 1b33979b832 |
13 | b4301631ba |
14 | 5b54970d26 |
15 | 31cdce9075 |
hex | 1bf6970be6 |
120101211110 has 32 divisors (see below), whose sum is σ = 220720338720. Its totient is φ = 47041475328.
The previous prime is 120101211107. The next prime is 120101211133. The reversal of 120101211110 is 11112101021.
It is a junction number, because it is equal to n+sod(n) for n = 120101211091 and 120101211100.
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 15 ways as a sum of consecutive naturals, for example, 490337 + ... + 693276.
It is an arithmetic number, because the mean of its divisors is an integer number (6897510585).
Almost surely, 2120101211110 is an apocalyptic number.
120101211110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
120101211110 is a deficient number, since it is larger than the sum of its proper divisors (100619127610).
120101211110 is a wasteful number, since it uses less digits than its factorization.
120101211110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1183832.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 120101211110 its reverse (11112101021), we get a palindrome (131213312131).
The spelling of 120101211110 in words is "one hundred twenty billion, one hundred one million, two hundred eleven thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •