Base | Representation |
---|---|
bin | 110111111011110111… |
… | …0001111011010011101 |
3 | 102111001101100222010110 |
4 | 1233313232033122131 |
5 | 3432001233223401 |
6 | 131103225000233 |
7 | 11451455643042 |
oct | 1576756173235 |
9 | 374041328113 |
10 | 120120211101 |
11 | 46a40800540 |
12 | 1b344023079 |
13 | b4340863b7 |
14 | 5b572b91c9 |
15 | 31d07ed9d6 |
hex | 1bf7b8f69d |
120120211101 has 8 divisors (see below), whose sum is σ = 174720307104. Its totient is φ = 72800127920.
The previous prime is 120120211069. The next prime is 120120211103. The reversal of 120120211101 is 101112021021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120120211101 - 25 = 120120211069 is a prime.
It is a super-2 number, since 2×1201202111012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120120211103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1820003166 + ... + 1820003231.
It is an arithmetic number, because the mean of its divisors is an integer number (21840038388).
Almost surely, 2120120211101 is an apocalyptic number.
120120211101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
120120211101 is a deficient number, since it is larger than the sum of its proper divisors (54600096003).
120120211101 is a wasteful number, since it uses less digits than its factorization.
120120211101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3640006411.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 120120211101 its reverse (101112021021), we get a palindrome (221232232122).
The spelling of 120120211101 in words is "one hundred twenty billion, one hundred twenty million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •