Base | Representation |
---|---|
bin | 111011111011100100… |
… | …001001111101001111 |
3 | 20011002200001211221012 |
4 | 323323210021331033 |
5 | 2023242111220302 |
6 | 45321221555435 |
7 | 4435440556601 |
oct | 737344117517 |
9 | 204080054835 |
10 | 64350101327 |
11 | 25321a55626 |
12 | 1057a875b7b |
13 | 60b6a6bc45 |
14 | 31864dd171 |
15 | 1a195d1a52 |
hex | efb909f4f |
64350101327 has 2 divisors, whose sum is σ = 64350101328. Its totient is φ = 64350101326.
The previous prime is 64350101279. The next prime is 64350101369. The reversal of 64350101327 is 72310105346.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 64350101327 - 220 = 64349052751 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 64350101293 and 64350101302.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (64350131327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 32175050663 + 32175050664.
It is an arithmetic number, because the mean of its divisors is an integer number (32175050664).
Almost surely, 264350101327 is an apocalyptic number.
64350101327 is a deficient number, since it is larger than the sum of its proper divisors (1).
64350101327 is an equidigital number, since it uses as much as digits as its factorization.
64350101327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15120, while the sum is 32.
The spelling of 64350101327 in words is "sixty-four billion, three hundred fifty million, one hundred one thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •