Base | Representation |
---|---|
bin | 110111111011100011… |
… | …1101101011000001101 |
3 | 102111000200100210022210 |
4 | 1233313013231120031 |
5 | 3431441142011341 |
6 | 131102224301033 |
7 | 11451304043313 |
oct | 1576707553015 |
9 | 374020323283 |
10 | 120110110221 |
11 | 46a36031602 |
12 | 1b340771779 |
13 | b431c5a94a |
14 | 5b55c0a0b3 |
15 | 31ce9a5c16 |
hex | 1bf71ed60d |
120110110221 has 8 divisors (see below), whose sum is σ = 161315769024. Its totient is φ = 79488929120.
The previous prime is 120110110213. The next prime is 120110110303. The reversal of 120110110221 is 122011011021.
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 120110110221 - 23 = 120110110213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120110110197 and 120110110206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120110110201) 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 7 ways as a sum of consecutive naturals, for example, 146118945 + ... + 146119766.
It is an arithmetic number, because the mean of its divisors is an integer number (20164471128).
Almost surely, 2120110110221 is an apocalyptic number.
It is an amenable number.
120110110221 is a deficient number, since it is larger than the sum of its proper divisors (41205658803).
120110110221 is a wasteful number, since it uses less digits than its factorization.
120110110221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292238851.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 120110110221 its reverse (122011011021), we get a palindrome (242121121242).
The spelling of 120110110221 in words is "one hundred twenty billion, one hundred ten million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •