Base | Representation |
---|---|
bin | 1111100100110… |
… | …0100110110100 |
3 | 11112220212201200 |
4 | 3321030212310 |
5 | 113210403432 |
6 | 10252052500 |
7 | 1422154221 |
oct | 371144664 |
9 | 145825650 |
10 | 65325492 |
11 | 33969011 |
12 | 19a64130 |
13 | 106c2c4b |
14 | 8966948 |
15 | 5b05a7c |
hex | 3e4c9b4 |
65325492 has 72 divisors (see below), whose sum is σ = 176137416. Its totient is φ = 20342784.
The previous prime is 65325479. The next prime is 65325493. The reversal of 65325492 is 29452356.
It can be written as a sum of positive squares in 4 ways, for example, as 13571856 + 51753636 = 3684^2 + 7194^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (65325493) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 105568 + ... + 106184.
It is an arithmetic number, because the mean of its divisors is an integer number (2446353).
Almost surely, 265325492 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 65325492, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88068708).
65325492 is an abundant number, since it is smaller than the sum of its proper divisors (110811924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65325492 is a wasteful number, since it uses less digits than its factorization.
65325492 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 817 (or 812 counting only the distinct ones).
The product of its digits is 64800, while the sum is 36.
The square root of 65325492 is about 8082.4186973950. The cubic root of 65325492 is about 402.7425941325.
The spelling of 65325492 in words is "sixty-five million, three hundred twenty-five thousand, four hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •