Base | Representation |
---|---|
bin | 1111010101101… |
… | …0010110101111 |
3 | 11111001110121021 |
4 | 3311122112233 |
5 | 112432130411 |
6 | 10214515011 |
7 | 1410552304 |
oct | 365322657 |
9 | 144043537 |
10 | 64333231 |
11 | 33350566 |
12 | 19665a67 |
13 | 10436401 |
14 | 87890ab |
15 | 59aba71 |
hex | 3d5a5af |
64333231 has 8 divisors (see below), whose sum is σ = 67616640. Its totient is φ = 61090392.
The previous prime is 64333201. The next prime is 64333237. The reversal of 64333231 is 13233346.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 64333231 - 27 = 64333103 is a prime.
It is a super-2 number, since 2×643332312 = 8277529221798722, which contains 22 as substring.
It is a Duffinian number.
It is a zygodrome in base 4.
It is a junction number, because it is equal to n+sod(n) for n = 64333196 and 64333205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64333237) 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 7 ways as a sum of consecutive naturals, for example, 6865 + ... + 13258.
It is an arithmetic number, because the mean of its divisors is an integer number (8452080).
Almost surely, 264333231 is an apocalyptic number.
64333231 is a deficient number, since it is larger than the sum of its proper divisors (3283409).
64333231 is a wasteful number, since it uses less digits than its factorization.
64333231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20285.
The product of its digits is 3888, while the sum is 25.
The square root of 64333231 is about 8020.7998977658. The cubic root of 64333231 is about 400.6930298307.
Adding to 64333231 its reverse (13233346), we get a palindrome (77566577).
The spelling of 64333231 in words is "sixty-four million, three hundred thirty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •