Base | Representation |
---|---|
bin | 111000100101000010… |
… | …0001110100100000100 |
3 | 102121121122220012112201 |
4 | 1301022010032210010 |
5 | 3442313414102000 |
6 | 131452255124244 |
7 | 11530632315316 |
oct | 1611204164404 |
9 | 377548805481 |
10 | 121501706500 |
11 | 4758a600479 |
12 | 1b66a813684 |
13 | b5c43562b5 |
14 | 5c489717b6 |
15 | 3261c3a96a |
hex | 1c4a10e904 |
121501706500 has 24 divisors (see below), whose sum is σ = 265359728088. Its totient is φ = 48600682400.
The previous prime is 121501706471. The next prime is 121501706503. The reversal of 121501706500 is 5607105121.
It can be written as a sum of positive squares in 4 ways, for example, as 5624100036 + 115877606464 = 74994^2 + 340408^2 .
It is not an unprimeable number, because it can be changed into a prime (121501706503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 121501207 + ... + 121502206.
It is an arithmetic number, because the mean of its divisors is an integer number (11056655337).
Almost surely, 2121501706500 is an apocalyptic number.
121501706500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
121501706500 is an abundant number, since it is smaller than the sum of its proper divisors (143858021588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121501706500 is a wasteful number, since it uses less digits than its factorization.
121501706500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243003432 (or 243003420 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 28.
The spelling of 121501706500 in words is "one hundred twenty-one billion, five hundred one million, seven hundred six thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •