Base | Representation |
---|---|
bin | 1111011010011… |
… | …0011110111010 |
3 | 11111122022100010 |
4 | 3312212132322 |
5 | 113022120200 |
6 | 10225322350 |
7 | 1413321351 |
oct | 366463672 |
9 | 144568303 |
10 | 64645050 |
11 | 33543868 |
12 | 197963b6 |
13 | 10515312 |
14 | 882a998 |
15 | 5a1e150 |
hex | 3da67ba |
64645050 has 96 divisors (see below), whose sum is σ = 172113984. Its totient is φ = 16000000.
The previous prime is 64645043. The next prime is 64645081. The reversal of 64645050 is 5054646.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 64644999 and 64645017.
It is an unprimeable number.
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, 257425 + ... + 257675.
It is an arithmetic number, because the mean of its divisors is an integer number (1792854).
Almost surely, 264645050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 64645050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (86056992).
64645050 is an abundant number, since it is smaller than the sum of its proper divisors (107468934).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64645050 is a wasteful number, since it uses less digits than its factorization.
64645050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384 (or 379 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
The square root of 64645050 is about 8040.2145493762. The cubic root of 64645050 is about 401.3393644185.
Adding to 64645050 its reverse (5054646), we get a palindrome (69699696).
The spelling of 64645050 in words is "sixty-four million, six hundred forty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •