Base | Representation |
---|---|
bin | 111000011010111001… |
… | …0110100110000111100 |
3 | 102120201221221000012220 |
4 | 1300311302310300330 |
5 | 3441114332200220 |
6 | 131354425325340 |
7 | 11516332415334 |
oct | 1606562646074 |
9 | 376657830186 |
10 | 121161600060 |
11 | 47425623476 |
12 | 1b594936850 |
13 | b56ba55397 |
14 | 5c1571c0c4 |
15 | 3241e58540 |
hex | 1c35cb4c3c |
121161600060 has 48 divisors (see below), whose sum is σ = 343546828800. Its totient is φ = 31900774464.
The previous prime is 121161599989. The next prime is 121161600083. The reversal of 121161600060 is 60006161121.
It is a self number, because there is not a number n which added to its sum of digits gives 121161600060.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12776020 + ... + 12785499.
It is an arithmetic number, because the mean of its divisors is an integer number (7157225600).
Almost surely, 2121161600060 is an apocalyptic number.
121161600060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121161600060 is an abundant number, since it is smaller than the sum of its proper divisors (222385228740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121161600060 is a wasteful number, since it uses less digits than its factorization.
121161600060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25561610 (or 25561608 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 121161600060 its reverse (60006161121), we get a palindrome (181167761181).
The spelling of 121161600060 in words is "one hundred twenty-one billion, one hundred sixty-one million, six hundred thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •