Base | Representation |
---|---|
bin | 1111010001010… |
… | …1010011100001 |
3 | 11110112002122002 |
4 | 3310111103201 |
5 | 112344103101 |
6 | 10204453345 |
7 | 1405263602 |
oct | 364252341 |
9 | 143462562 |
10 | 64050401 |
11 | 33178018 |
12 | 1954a255 |
13 | 1036775c |
14 | 8713da9 |
15 | 5952d6b |
hex | 3d154e1 |
64050401 has 2 divisors, whose sum is σ = 64050402. Its totient is φ = 64050400.
The previous prime is 64050397. The next prime is 64050403. The reversal of 64050401 is 10405046.
It is a happy number.
64050401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 55056400 + 8994001 = 7420^2 + 2999^2 .
It is a cyclic number.
It is not a de Polignac number, because 64050401 - 22 = 64050397 is a prime.
Together with 64050403, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (64050403) 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, 32025200 + 32025201.
It is an arithmetic number, because the mean of its divisors is an integer number (32025201).
Almost surely, 264050401 is an apocalyptic number.
It is an amenable number.
64050401 is a deficient number, since it is larger than the sum of its proper divisors (1).
64050401 is an equidigital number, since it uses as much as digits as its factorization.
64050401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 64050401 is about 8003.1494425632. The cubic root of 64050401 is about 400.1049745318.
Adding to 64050401 its reverse (10405046), we get a palindrome (74455447).
The spelling of 64050401 in words is "sixty-four million, fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •