Base | Representation |
---|---|
bin | 1111010010110… |
… | …0100011100100 |
3 | 11110200221021022 |
4 | 3310230203210 |
5 | 112410130021 |
6 | 10210510312 |
7 | 1406141342 |
oct | 364544344 |
9 | 143627238 |
10 | 64145636 |
11 | 33232625 |
12 | 19595398 |
13 | 1039bbc9 |
14 | 873a992 |
15 | 59711ab |
hex | 3d2c8e4 |
64145636 has 12 divisors (see below), whose sum is σ = 112355628. Its totient is φ = 32044032.
The previous prime is 64145633. The next prime is 64145657. The reversal of 64145636 is 63654146.
64145636 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 31427236 + 32718400 = 5606^2 + 5720^2 .
It is a super-2 number, since 2×641456362 = 8229325235688992, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 64145596 and 64145605.
It is not an unprimeable number, because it can be changed into a prime (64145633) 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 3 ways as a sum of consecutive naturals, for example, 1721 + ... + 11456.
It is an arithmetic number, because the mean of its divisors is an integer number (9362969).
Almost surely, 264145636 is an apocalyptic number.
It is an amenable number.
64145636 is a deficient number, since it is larger than the sum of its proper divisors (48209992).
64145636 is a wasteful number, since it uses less digits than its factorization.
64145636 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14398 (or 14396 counting only the distinct ones).
The product of its digits is 51840, while the sum is 35.
The square root of 64145636 is about 8009.0970776986. The cubic root of 64145636 is about 400.3031784823.
The spelling of 64145636 in words is "sixty-four million, one hundred forty-five thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •