Base | Representation |
---|---|
bin | 101000110000000111… |
… | …0100111011010101010 |
3 | 22100212222122011100000 |
4 | 1101200032213122222 |
5 | 2413212012240442 |
6 | 104111524123430 |
7 | 6215446641153 |
oct | 1214016473252 |
9 | 270788564300 |
10 | 87513790122 |
11 | 34129286890 |
12 | 14b64236576 |
13 | 8338a10885 |
14 | 4342a3a92a |
15 | 2422e76d4c |
hex | 14603a76aa |
87513790122 has 96 divisors (see below), whose sum is σ = 214620456960. Its totient is φ = 26505915120.
The previous prime is 87513790121. The next prime is 87513790141. The reversal of 87513790122 is 22109731578.
87513790122 is a `hidden beast` number, since 8 + 7 + 513 + 7 + 9 + 0 + 122 = 666.
It is not an unprimeable number, because it can be changed into a prime (87513790121) 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 47 ways as a sum of consecutive naturals, for example, 17420103 + ... + 17425125.
It is an arithmetic number, because the mean of its divisors is an integer number (2235629760).
Almost surely, 287513790122 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 87513790122, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (107310228480).
87513790122 is an abundant number, since it is smaller than the sum of its proper divisors (127106666838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
87513790122 is a wasteful number, since it uses less digits than its factorization.
87513790122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8310 (or 8298 counting only the distinct ones).
The product of its (nonzero) digits is 211680, while the sum is 45.
The spelling of 87513790122 in words is "eighty-seven billion, five hundred thirteen million, seven hundred ninety thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •