Base | Representation |
---|---|
bin | 1111010110010… |
… | …0001010011001 |
3 | 11111010111201001 |
4 | 3311210022121 |
5 | 112434422101 |
6 | 10215425001 |
7 | 1411110361 |
oct | 365441231 |
9 | 144114631 |
10 | 64373401 |
11 | 33378764 |
12 | 19685161 |
13 | 1044b791 |
14 | 87999a1 |
15 | 59b8901 |
hex | 3d64299 |
64373401 has 2 divisors, whose sum is σ = 64373402. Its totient is φ = 64373400.
The previous prime is 64373369. The next prime is 64373431. The reversal of 64373401 is 10437346.
64373401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is the 3276-th star number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60047001 + 4326400 = 7749^2 + 2080^2 .
It is a cyclic number.
It is not a de Polignac number, because 64373401 - 25 = 64373369 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 64373401.
It is not a weakly prime, because it can be changed into another prime (64373431) 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, 32186700 + 32186701.
It is an arithmetic number, because the mean of its divisors is an integer number (32186701).
Almost surely, 264373401 is an apocalyptic number.
It is an amenable number.
64373401 is a deficient number, since it is larger than the sum of its proper divisors (1).
64373401 is an equidigital number, since it uses as much as digits as its factorization.
64373401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 28.
The square root of 64373401 is about 8023.3036213271. The cubic root of 64373401 is about 400.7764107408.
The spelling of 64373401 in words is "sixty-four million, three hundred seventy-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •