Base | Representation |
---|---|
bin | 1111100001110… |
… | …1000110100000 |
3 | 11112112222211000 |
4 | 3320131012200 |
5 | 113133142122 |
6 | 10243552000 |
7 | 1420414020 |
oct | 370350640 |
9 | 145488730 |
10 | 65130912 |
11 | 33845900 |
12 | 1998b600 |
13 | 10655502 |
14 | 8915a80 |
15 | 5ab80ac |
hex | 3e1d1a0 |
65130912 has 288 divisors, whose sum is σ = 241315200. Its totient is φ = 16727040.
The previous prime is 65130911. The next prime is 65130929. The reversal of 65130912 is 21903156.
65130912 is a `hidden beast` number, since 651 + 3 + 0 + 9 + 1 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (288).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (65130911) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 731764 + ... + 731852.
It is an arithmetic number, because the mean of its divisors is an integer number (837900).
Almost surely, 265130912 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 65130912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120657600).
65130912 is an abundant number, since it is smaller than the sum of its proper divisors (176184288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65130912 is a wasteful number, since it uses less digits than its factorization.
65130912 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137 (or 112 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 65130912 is about 8070.3724821101. The cubic root of 65130912 is about 402.3423236928.
The spelling of 65130912 in words is "sixty-five million, one hundred thirty thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •