Base | Representation |
---|---|
bin | 1111011000011… |
… | …1111111011101 |
3 | 11111101222000110 |
4 | 3312013333131 |
5 | 113004121112 |
6 | 10222520233 |
7 | 1412261262 |
oct | 366077735 |
9 | 144358013 |
10 | 64520157 |
11 | 33468a49 |
12 | 19736079 |
13 | 104a0510 |
14 | 87d7269 |
15 | 59e713c |
hex | 3d87fdd |
64520157 has 16 divisors (see below), whose sum is σ = 95840640. Its totient is φ = 38334912.
The previous prime is 64520153. The next prime is 64520161. The reversal of 64520157 is 75102546.
It is an interprime number because it is at equal distance from previous prime (64520153) and next prime (64520161).
It is not a de Polignac number, because 64520157 - 22 = 64520153 is a prime.
It is a super-3 number, since 3×645201573 (a number of 24 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64520153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27393 + ... + 29654.
It is an arithmetic number, because the mean of its divisors is an integer number (5990040).
Almost surely, 264520157 is an apocalyptic number.
It is an amenable number.
64520157 is a deficient number, since it is larger than the sum of its proper divisors (31320483).
64520157 is a wasteful number, since it uses less digits than its factorization.
64520157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57092.
The product of its (nonzero) digits is 8400, while the sum is 30.
The square root of 64520157 is about 8032.4440240813. Note that the first 3 decimals coincide. The cubic root of 64520157 is about 401.0807378014.
It can be divided in two parts, 645 and 20157, that added together give a palindrome (20802).
The spelling of 64520157 in words is "sixty-four million, five hundred twenty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •