Base | Representation |
---|---|
bin | 1111100000100… |
… | …1001111010000 |
3 | 11112101212012200 |
4 | 3320021033100 |
5 | 113123041202 |
6 | 10242123200 |
7 | 1416624561 |
oct | 370111720 |
9 | 145355180 |
10 | 65049552 |
11 | 3379a767 |
12 | 19950500 |
13 | 10627479 |
14 | 88d4168 |
15 | 5a9de1c |
hex | 3e093d0 |
65049552 has 120 divisors (see below), whose sum is σ = 193875240. Its totient is φ = 20321280.
The previous prime is 65049541. The next prime is 65049571. The reversal of 65049552 is 25594056.
65049552 is a `hidden beast` number, since 65 + 0 + 49 + 552 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 4769856 + 60279696 = 2184^2 + 7764^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 154302 + ... + 154722.
It is an arithmetic number, because the mean of its divisors is an integer number (1615627).
Almost surely, 265049552 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 65049552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (96937620).
65049552 is an abundant number, since it is smaller than the sum of its proper divisors (128825688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65049552 is a wasteful number, since it uses less digits than its factorization.
65049552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 501 (or 492 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
The square root of 65049552 is about 8065.3302474232. The cubic root of 65049552 is about 402.1747217030.
The spelling of 65049552 in words is "sixty-five million, forty-nine thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •