Base | Representation |
---|---|
bin | 1111010001010… |
… | …1111000100001 |
3 | 11110112012212210 |
4 | 3310111320201 |
5 | 112344142034 |
6 | 10204512333 |
7 | 1405303524 |
oct | 364257041 |
9 | 143465783 |
10 | 64052769 |
11 | 33179880 |
12 | 1954b6a9 |
13 | 10368861 |
14 | 8714bbb |
15 | 59538e9 |
hex | 3d15e21 |
64052769 has 16 divisors (see below), whose sum is σ = 97219584. Its totient is φ = 37131600.
The previous prime is 64052767. The next prime is 64052773. The reversal of 64052769 is 96725046.
64052769 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 64052769 - 21 = 64052767 is a prime.
It is a super-2 number, since 2×640527692 = 8205514433134722, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (64052767) 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 15 ways as a sum of consecutive naturals, for example, 41437 + ... + 42954.
It is an arithmetic number, because the mean of its divisors is an integer number (6076224).
Almost surely, 264052769 is an apocalyptic number.
64052769 is a gapful number since it is divisible by the number (69) formed by its first and last digit.
It is an amenable number.
64052769 is a deficient number, since it is larger than the sum of its proper divisors (33166815).
64052769 is a wasteful number, since it uses less digits than its factorization.
64052769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84428.
The product of its (nonzero) digits is 90720, while the sum is 39.
The square root of 64052769 is about 8003.2973829541. The cubic root of 64052769 is about 400.1099052160.
The spelling of 64052769 in words is "sixty-four million, fifty-two thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •