Base | Representation |
---|---|
bin | 110111111011111000… |
… | …1101011101010000110 |
3 | 102111001110001210121100 |
4 | 1233313301223222012 |
5 | 3432002001110342 |
6 | 131103300200530 |
7 | 11451466421115 |
oct | 1576761535206 |
9 | 374043053540 |
10 | 120121113222 |
11 | 46a412672a0 |
12 | 1b344399146 |
13 | b434310bb6 |
14 | 5b57471c7c |
15 | 31d092ae4c |
hex | 1bf7c6ba86 |
120121113222 has 48 divisors (see below), whose sum is σ = 283970009232. Its totient is φ = 36394263360.
The previous prime is 120121113221. The next prime is 120121113227. The reversal of 120121113222 is 222311121021.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 120121113195 and 120121113204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120121113221) 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 23 ways as a sum of consecutive naturals, for example, 1219188 + ... + 1314024.
It is an arithmetic number, because the mean of its divisors is an integer number (5916041859).
Almost surely, 2120121113222 is an apocalyptic number.
120121113222 is an abundant number, since it is smaller than the sum of its proper divisors (163848896010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120121113222 is a wasteful number, since it uses less digits than its factorization.
120121113222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101253 (or 101250 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 120121113222 its reverse (222311121021), we get a palindrome (342432234243).
The spelling of 120121113222 in words is "one hundred twenty billion, one hundred twenty-one million, one hundred thirteen thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •