Base | Representation |
---|---|
bin | 11100101110101011100… |
… | …10101000100011100001 |
3 | 10111100222002101201122200 |
4 | 32113111302220203201 |
5 | 112133122342043410 |
6 | 2033252214323413 |
7 | 131214052241166 |
oct | 16272562504341 |
9 | 3440862351580 |
10 | 987134331105 |
11 | 35070666048a |
12 | 13b391359569 |
13 | 7211799ab00 |
14 | 35ac588806d |
15 | 1aa26eeb3c0 |
hex | e5d5ca88e1 |
987134331105 has 72 divisors (see below), whose sum is σ = 1853712993600. Its totient is φ = 485727854976.
The previous prime is 987134331049. The next prime is 987134331187. The reversal of 987134331105 is 501133431789.
987134331105 is a `hidden beast` number, since 9 + 87 + 134 + 331 + 105 = 666.
987134331105 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 987134331105 - 210 = 987134330081 is a prime.
It is a super-2 number, since 2×9871343311052 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 15474766 + ... + 15538424.
It is an arithmetic number, because the mean of its divisors is an integer number (25746013800).
Almost surely, 2987134331105 is an apocalyptic number.
It is an amenable number.
987134331105 is a deficient number, since it is larger than the sum of its proper divisors (866578662495).
987134331105 is a wasteful number, since it uses less digits than its factorization.
987134331105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65735 (or 65719 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The spelling of 987134331105 in words is "nine hundred eighty-seven billion, one hundred thirty-four million, three hundred thirty-one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •