Base | Representation |
---|---|
bin | 111000011010111001… |
… | …0000100011101111000 |
3 | 102120201221112221211221 |
4 | 1300311302010131320 |
5 | 3441114304332412 |
6 | 131354421201424 |
7 | 11516330632513 |
oct | 1606562043570 |
9 | 376657487757 |
10 | 121161402232 |
11 | 474254a8882 |
12 | 1b594860274 |
13 | b56b9b6320 |
14 | 5c156a9d7a |
15 | 3241e19b07 |
hex | 1c35c84778 |
121161402232 has 64 divisors (see below), whose sum is σ = 250716332160. Its totient is φ = 54535756800.
The previous prime is 121161402227. The next prime is 121161402259. The reversal of 121161402232 is 232204161121.
It is a junction number, because it is equal to n+sod(n) for n = 121161402197 and 121161402206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18208218 + ... + 18214870.
It is an arithmetic number, because the mean of its divisors is an integer number (3917442690).
Almost surely, 2121161402232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 121161402232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125358166080).
121161402232 is an abundant number, since it is smaller than the sum of its proper divisors (129554929928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121161402232 is a wasteful number, since it uses less digits than its factorization.
121161402232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10984 (or 10980 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 121161402232 its reverse (232204161121), we get a palindrome (353365563353).
The spelling of 121161402232 in words is "one hundred twenty-one billion, one hundred sixty-one million, four hundred two thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •