Base | Representation |
---|---|
bin | 11100101111000011000… |
… | …00110001010101100000 |
3 | 10111101110210102021110120 |
4 | 32113201200301111200 |
5 | 112134023212200242 |
6 | 2033323521200240 |
7 | 131221660550211 |
oct | 16274140612540 |
9 | 3441423367416 |
10 | 987330975072 |
11 | 3507a7660a62 |
12 | 13b427190080 |
13 | 7214964b6a0 |
14 | 35b03a35408 |
15 | 1aa393e11ec |
hex | e5e1831560 |
987330975072 has 48 divisors (see below), whose sum is σ = 2791108721520. Its totient is φ = 303794145792.
The previous prime is 987330975023. The next prime is 987330975091. The reversal of 987330975072 is 270579033789.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 987330974997 and 987330975015.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 395564047 + ... + 395566542.
It is an arithmetic number, because the mean of its divisors is an integer number (58148098365).
Almost surely, 2987330975072 is an apocalyptic number.
It is an amenable number.
987330975072 is an abundant number, since it is smaller than the sum of its proper divisors (1803777746448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
987330975072 is a wasteful number, since it uses less digits than its factorization.
987330975072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 791130615 (or 791130607 counting only the distinct ones).
The product of its (nonzero) digits is 20003760, while the sum is 60.
The spelling of 987330975072 in words is "nine hundred eighty-seven billion, three hundred thirty million, nine hundred seventy-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •