Base | Representation |
---|---|
bin | 1111010010111… |
… | …1001001010000 |
3 | 11110201110211001 |
4 | 3310233021100 |
5 | 112410444430 |
6 | 10211031344 |
7 | 1406214301 |
oct | 364571120 |
9 | 143643731 |
10 | 64156240 |
11 | 3323a595 |
12 | 1959b554 |
13 | 103a3995 |
14 | 87407a8 |
15 | 59743ca |
hex | 3d2f250 |
64156240 has 40 divisors (see below), whose sum is σ = 149499360. Its totient is φ = 25604736.
The previous prime is 64156229. The next prime is 64156241. The reversal of 64156240 is 4265146.
64156240 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (40).
It is a junction number, because it is equal to n+sod(n) for n = 64156199 and 64156208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64156241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62451 + ... + 63469.
It is an arithmetic number, because the mean of its divisors is an integer number (3737484).
Almost surely, 264156240 is an apocalyptic number.
It is an amenable number.
64156240 is an abundant number, since it is smaller than the sum of its proper divisors (85343120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
64156240 is a wasteful number, since it uses less digits than its factorization.
64156240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1819 (or 1813 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
The square root of 64156240 is about 8009.7590475619. The cubic root of 64156240 is about 400.3252354830.
The spelling of 64156240 in words is "sixty-four million, one hundred fifty-six thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •