Base | Representation |
---|---|
bin | 1111100000000… |
… | …0010011111011 |
3 | 11112100000001102 |
4 | 3320000103323 |
5 | 113120403422 |
6 | 10241242015 |
7 | 1416413144 |
oct | 370002373 |
9 | 145300042 |
10 | 65012987 |
11 | 33775246 |
12 | 1993330b |
13 | 10613930 |
14 | 88c4acb |
15 | 5a93192 |
hex | 3e004fb |
65012987 has 16 divisors (see below), whose sum is σ = 71759520. Its totient is φ = 58536192.
The previous prime is 65012957. The next prime is 65012999. The reversal of 65012987 is 78921056.
65012987 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 65012987 - 210 = 65011963 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
65012987 is a modest number, since divided by 12987 gives 65 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 65012987.
It is not an unprimeable number, because it can be changed into a prime (65012957) 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 15 ways as a sum of consecutive naturals, for example, 95693 + ... + 96369.
It is an arithmetic number, because the mean of its divisors is an integer number (4484970).
Almost surely, 265012987 is an apocalyptic number.
65012987 is a deficient number, since it is larger than the sum of its proper divisors (6746533).
65012987 is a wasteful number, since it uses less digits than its factorization.
65012987 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 862.
The product of its (nonzero) digits is 30240, while the sum is 38.
The square root of 65012987 is about 8063.0631276209. The cubic root of 65012987 is about 402.0993521092.
The spelling of 65012987 in words is "sixty-five million, twelve thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •