Base | Representation |
---|---|
bin | 1111010011110… |
… | …1000101000001 |
3 | 11110211101002212 |
4 | 3310331011001 |
5 | 112414311223 |
6 | 10212151505 |
7 | 1406542553 |
oct | 364750501 |
9 | 143741085 |
10 | 64213313 |
11 | 3327945a |
12 | 19608595 |
13 | 103c3958 |
14 | 87574d3 |
15 | 5986278 |
hex | 3d3d141 |
64213313 has 2 divisors, whose sum is σ = 64213314. Its totient is φ = 64213312.
The previous prime is 64213283. The next prime is 64213343. The reversal of 64213313 is 31331246.
64213313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (64213283) and next prime (64213343).
It can be written as a sum of positive squares in only one way, i.e., 36881329 + 27331984 = 6073^2 + 5228^2 .
It is a cyclic number.
It is not a de Polignac number, because 64213313 - 214 = 64196929 is a prime.
It is not a weakly prime, because it can be changed into another prime (64213343) 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 as a sum of consecutive naturals, namely, 32106656 + 32106657.
It is an arithmetic number, because the mean of its divisors is an integer number (32106657).
Almost surely, 264213313 is an apocalyptic number.
It is an amenable number.
64213313 is a deficient number, since it is larger than the sum of its proper divisors (1).
64213313 is an equidigital number, since it uses as much as digits as its factorization.
64213313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1296, while the sum is 23.
The square root of 64213313 is about 8013.3209719816. The cubic root of 64213313 is about 400.4439092625.
Adding to 64213313 its reverse (31331246), we get a palindrome (95544559).
The spelling of 64213313 in words is "sixty-four million, two hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •