Base | Representation |
---|---|
bin | 1111010101010… |
… | …1111010101101 |
3 | 11111000112200000 |
4 | 3311111322231 |
5 | 112431040203 |
6 | 10214254513 |
7 | 1410445305 |
oct | 365257255 |
9 | 144015600 |
10 | 64315053 |
11 | 33338940 |
12 | 19657439 |
13 | 1042b05a |
14 | 8782605 |
15 | 59a64a3 |
hex | 3d55ead |
64315053 has 24 divisors (see below), whose sum is σ = 105102816. Its totient is φ = 38977200.
The previous prime is 64315039. The next prime is 64315093. The reversal of 64315053 is 35051346.
64315053 is a `hidden beast` number, since 643 + 15 + 0 + 5 + 3 = 666.
It is not a de Polignac number, because 64315053 - 24 = 64315037 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a zygodrome in base 3.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64315093) 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 23 ways as a sum of consecutive naturals, for example, 9358 + ... + 14703.
It is an arithmetic number, because the mean of its divisors is an integer number (4379284).
Almost surely, 264315053 is an apocalyptic number.
It is an amenable number.
64315053 is a deficient number, since it is larger than the sum of its proper divisors (40787763).
64315053 is a wasteful number, since it uses less digits than its factorization.
64315053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24087 (or 24075 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 27.
The square root of 64315053 is about 8019.6666389570. Note that the first 4 decimals coincide. The cubic root of 64315053 is about 400.6552863300.
Adding to 64315053 its reverse (35051346), we get a palindrome (99366399).
The spelling of 64315053 in words is "sixty-four million, three hundred fifteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •