Base | Representation |
---|---|
bin | 111000011100101001… |
… | …0000100001010000110 |
3 | 102120220001001012011100 |
4 | 1300321102010022012 |
5 | 3441224322334342 |
6 | 131404315520530 |
7 | 11520643013064 |
oct | 1607122041206 |
9 | 376801035140 |
10 | 121220121222 |
11 | 47455664272 |
12 | 1b5b0459146 |
13 | b57ac051a5 |
14 | 5c1d3d3034 |
15 | 3247167e4c |
hex | 1c39484286 |
121220121222 has 48 divisors (see below), whose sum is σ = 282652168032. Its totient is φ = 37406396160.
The previous prime is 121220121193. The next prime is 121220121251. The reversal of 121220121222 is 222121022121.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (121220121193) and next prime (121220121251).
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 = 121220121195 and 121220121204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3228418 + ... + 3265749.
It is an arithmetic number, because the mean of its divisors is an integer number (5888586834).
Almost surely, 2121220121222 is an apocalyptic number.
121220121222 is an abundant number, since it is smaller than the sum of its proper divisors (161432046810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121220121222 is a wasteful number, since it uses less digits than its factorization.
121220121222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6494253 (or 6494250 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 121220121222 its reverse (222121022121), we get a palindrome (343341143343).
The spelling of 121220121222 in words is "one hundred twenty-one billion, two hundred twenty million, one hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •