Base | Representation |
---|---|
bin | 1111100000111… |
… | …0011010001100 |
3 | 11112102221021010 |
4 | 3320032122030 |
5 | 113124230412 |
6 | 10242405220 |
7 | 1420043406 |
oct | 370163214 |
9 | 145387233 |
10 | 65070732 |
11 | 33804671 |
12 | 19960810 |
13 | 10633cbc |
14 | 88dbb76 |
15 | 5aa533c |
hex | 3e0e68c |
65070732 has 24 divisors (see below), whose sum is σ = 152841472. Its totient is φ = 21546000.
The previous prime is 65070727. The next prime is 65070737. The reversal of 65070732 is 23707056.
65070732 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (65070727) and next prime (65070737).
It is a self number, because there is not a number n which added to its sum of digits gives 65070732.
It is not an unprimeable number, because it can be changed into a prime (65070737) 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 7 ways as a sum of consecutive naturals, for example, 16144 + ... + 19767.
Almost surely, 265070732 is an apocalyptic number.
It is an amenable number.
65070732 is an abundant number, since it is smaller than the sum of its proper divisors (87770740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65070732 is a wasteful number, since it uses less digits than its factorization.
65070732 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36069 (or 36067 counting only the distinct ones).
The product of its (nonzero) digits is 8820, while the sum is 30.
The square root of 65070732 is about 8066.6431680099. The cubic root of 65070732 is about 402.2183660532.
Adding to 65070732 its reverse (23707056), we get a palindrome (88777788).
The spelling of 65070732 in words is "sixty-five million, seventy thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •