Base | Representation |
---|---|
bin | 1111010011100… |
… | …1110111010110 |
3 | 11110210201001100 |
4 | 3310321313112 |
5 | 112413401100 |
6 | 10212010530 |
7 | 1406456310 |
oct | 364716726 |
9 | 143721040 |
10 | 64200150 |
11 | 3326a583 |
12 | 19600a46 |
13 | 103ba971 |
14 | 87527b0 |
15 | 5982400 |
hex | 3d39dd6 |
64200150 has 144 divisors (see below), whose sum is σ = 200210400. Its totient is φ = 14446080.
The previous prime is 64200131. The next prime is 64200179. The reversal of 64200150 is 5100246.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a congruent number.
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 71 ways as a sum of consecutive naturals, for example, 280236 + ... + 280464.
It is an arithmetic number, because the mean of its divisors is an integer number (1390350).
Almost surely, 264200150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 64200150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (100105200).
64200150 is an abundant number, since it is smaller than the sum of its proper divisors (136010250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64200150 is a wasteful number, since it uses less digits than its factorization.
64200150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343 (or 335 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 64200150 is about 8012.4996099844. The cubic root of 64200150 is about 400.4165452412.
Adding to 64200150 its reverse (5100246), we get a palindrome (69300396).
The spelling of 64200150 in words is "sixty-four million, two hundred thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •