Base | Representation |
---|---|
bin | 1111100001001… |
… | …1010110001000 |
3 | 11112110222000000 |
4 | 3320103112020 |
5 | 113130402302 |
6 | 10243043000 |
7 | 1420156353 |
oct | 370232610 |
9 | 145428000 |
10 | 65090952 |
11 | 33818883 |
12 | 19970460 |
13 | 10640274 |
14 | 890529a |
15 | 5aab31c |
hex | 3e13588 |
65090952 has 56 divisors (see below), whose sum is σ = 183000990. Its totient is φ = 21695040.
The previous prime is 65090947. The next prime is 65090957. The reversal of 65090952 is 25909056.
It is an interprime number because it is at equal distance from previous prime (65090947) and next prime (65090957).
It can be written as a sum of positive squares in only one way, i.e., 64738116 + 352836 = 8046^2 + 594^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (65090957) by changing a digit.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 252 + ... + 11412.
Almost surely, 265090952 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 65090952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (91500495).
65090952 is an abundant number, since it is smaller than the sum of its proper divisors (117910038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65090952 is a wasteful number, since it uses less digits than its factorization.
65090952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11185 (or 11166 counting only the distinct ones).
The product of its (nonzero) digits is 24300, while the sum is 36.
The square root of 65090952 is about 8067.8963800981. The cubic root of 65090952 is about 402.2600233537.
The spelling of 65090952 in words is "sixty-five million, ninety thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •