Base | Representation |
---|---|
bin | 1111011100011… |
… | …0010101111110 |
3 | 11111212221100110 |
4 | 3313012111332 |
5 | 113040304200 |
6 | 10232210450 |
7 | 1414404000 |
oct | 367062576 |
9 | 144787313 |
10 | 64775550 |
11 | 33622914 |
12 | 19839a26 |
13 | 1055c838 |
14 | 8862370 |
15 | 5a47b50 |
hex | 3dc657e |
64775550 has 96 divisors (see below), whose sum is σ = 187488000. Its totient is φ = 14794080.
The previous prime is 64775507. The next prime is 64775551. The reversal of 64775550 is 5557746.
It is a junction number, because it is equal to n+sod(n) for n = 64775499 and 64775508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64775551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 50821 + ... + 52079.
It is an arithmetic number, because the mean of its divisors is an integer number (1953000).
Almost surely, 264775550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 64775550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (93744000).
64775550 is an abundant number, since it is smaller than the sum of its proper divisors (122712450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64775550 is a wasteful number, since it uses less digits than its factorization.
64775550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1295 (or 1276 counting only the distinct ones).
The product of its (nonzero) digits is 147000, while the sum is 39.
The square root of 64775550 is about 8048.3259128840. The cubic root of 64775550 is about 401.6092463004.
The spelling of 64775550 in words is "sixty-four million, seven hundred seventy-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •