Base | Representation |
---|---|
bin | 111000011001010111… |
… | …0110000011100001010 |
3 | 102120121101012201111120 |
4 | 1300302232300130022 |
5 | 3441013202431442 |
6 | 131345351540110 |
7 | 11515136506200 |
oct | 1606256603412 |
9 | 376541181446 |
10 | 121110202122 |
11 | 473a9608438 |
12 | 1b57b68a636 |
13 | b5611ca8c0 |
14 | 5c0c97d070 |
15 | 323c6a44ec |
hex | 1c32bb070a |
121110202122 has 192 divisors, whose sum is σ = 312317792640. Its totient is φ = 31010563584.
The previous prime is 121110202111. The next prime is 121110202123. The reversal of 121110202122 is 221202011121.
It is not an unprimeable number, because it can be changed into a prime (121110202123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 121474128 + ... + 121475124.
It is an arithmetic number, because the mean of its divisors is an integer number (1626655170).
Almost surely, 2121110202122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121110202122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156158896320).
121110202122 is an abundant number, since it is smaller than the sum of its proper divisors (191207590518).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121110202122 is a wasteful number, since it uses less digits than its factorization.
121110202122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1925 (or 1918 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 121110202122 its reverse (221202011121), we get a palindrome (342312213243).
The spelling of 121110202122 in words is "one hundred twenty-one billion, one hundred ten million, two hundred two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •