Base | Representation |
---|---|
bin | 110111111011111010… |
… | …1011111010011110101 |
3 | 102111001111221111121021 |
4 | 1233313311133103311 |
5 | 3432002230024341 |
6 | 131103333421141 |
7 | 11451511045540 |
oct | 1576765372365 |
9 | 374044844537 |
10 | 120122111221 |
11 | 46a41889092 |
12 | 1b34479a7b1 |
13 | b4345a0228 |
14 | 5b57651857 |
15 | 31d0a769d1 |
hex | 1bf7d5f4f5 |
120122111221 has 8 divisors (see below), whose sum is σ = 137313500544. Its totient is φ = 102938493840.
The previous prime is 120122111183. The next prime is 120122111261. The reversal of 120122111221 is 122111221021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 120122111221 - 27 = 120122111093 is a prime.
It is a super-2 number, since 2×1201221112212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120122111195 and 120122111204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120122111261) 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, 1909825 + ... + 1971718.
It is an arithmetic number, because the mean of its divisors is an integer number (17164187568).
Almost surely, 2120122111221 is an apocalyptic number.
It is an amenable number.
120122111221 is a deficient number, since it is larger than the sum of its proper divisors (17191389323).
120122111221 is an equidigital number, since it uses as much as digits as its factorization.
120122111221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3885971.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 120122111221 its reverse (122111221021), we get a palindrome (242233332242).
The spelling of 120122111221 in words is "one hundred twenty billion, one hundred twenty-two million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •