Base | Representation |
---|---|
bin | 111010110111110… |
… | …000011111100000 |
3 | 2112211112002220222 |
4 | 322313300133200 |
5 | 4010322220242 |
6 | 242001422212 |
7 | 33322161320 |
oct | 7267603740 |
9 | 2484462828 |
10 | 987695072 |
11 | 467589a21 |
12 | 23693a968 |
13 | 12981c470 |
14 | 95267280 |
15 | 5baa05d2 |
hex | 3adf07e0 |
987695072 has 96 divisors (see below), whose sum is σ = 2497485312. Its totient is φ = 373722624.
The previous prime is 987695041. The next prime is 987695081. The reversal of 987695072 is 270596789.
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 15 ways as a sum of consecutive naturals, for example, 59603 + ... + 74349.
It is an arithmetic number, because the mean of its divisors is an integer number (26015472).
Almost surely, 2987695072 is an apocalyptic number.
987695072 is a gapful number since it is divisible by the number (92) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 987695072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1248742656).
987695072 is an abundant number, since it is smaller than the sum of its proper divisors (1509790240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
987695072 is a wasteful number, since it uses less digits than its factorization.
987695072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14800 (or 14792 counting only the distinct ones).
The product of its (nonzero) digits is 1905120, while the sum is 53.
The square root of 987695072 is about 31427.6163906842. The cubic root of 987695072 is about 995.8814179023.
The spelling of 987695072 in words is "nine hundred eighty-seven million, six hundred ninety-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •