Base | Representation |
---|---|
bin | 111000101000100101… |
… | …1100101001100111110 |
3 | 102121220222111202000000 |
4 | 1301101023211030332 |
5 | 3443034443343000 |
6 | 131512201415130 |
7 | 11533612035600 |
oct | 1612113451476 |
9 | 377828452000 |
10 | 121621074750 |
11 | 47640a2061a |
12 | 1b6a279a4a6 |
13 | b612cbb7b6 |
14 | 5c5a765170 |
15 | 326c469000 |
hex | 1c512e533e |
121621074750 has 336 divisors, whose sum is σ = 397116542160. Its totient is φ = 27797061600.
The previous prime is 121621074749. The next prime is 121621074763. The reversal of 121621074750 is 57470126121.
121621074750 is a `hidden beast` number, since 1 + 21 + 62 + 107 + 475 + 0 = 666.
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 167 ways as a sum of consecutive naturals, for example, 8923441 + ... + 8937059.
Almost surely, 2121621074750 is an apocalyptic number.
121621074750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 121621074750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (198558271080).
121621074750 is an abundant number, since it is smaller than the sum of its proper divisors (275495467410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121621074750 is an equidigital number, since it uses as much as digits as its factorization.
121621074750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13668 (or 13636 counting only the distinct ones).
The product of its (nonzero) digits is 23520, while the sum is 36.
The spelling of 121621074750 in words is "one hundred twenty-one billion, six hundred twenty-one million, seventy-four thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •