Base | Representation |
---|---|
bin | 11101011001010101111100… |
… | …00010001010010101000111 |
3 | 22110212202110012122122022111 |
4 | 32230222332002022111013 |
5 | 31433100212141324224 |
6 | 345252155120441451 |
7 | 16421156034256456 |
oct | 1654527602122507 |
9 | 273782405578274 |
10 | 64642446042439 |
11 | 19662786625191 |
12 | 7300180479287 |
13 | 2a0b9ab073565 |
14 | 11d69d52d0b9d |
15 | 771771ed0d94 |
hex | 3acabe08a547 |
64642446042439 has 2 divisors, whose sum is σ = 64642446042440. Its totient is φ = 64642446042438.
The previous prime is 64642446042437. The next prime is 64642446042511. The reversal of 64642446042439 is 93424064424646.
It is a happy number.
64642446042439 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 64642446042439 - 21 = 64642446042437 is a prime.
Together with 64642446042437, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (64642446042437) 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, 32321223021219 + 32321223021220.
It is an arithmetic number, because the mean of its divisors is an integer number (32321223021220).
Almost surely, 264642446042439 is an apocalyptic number.
64642446042439 is a deficient number, since it is larger than the sum of its proper divisors (1).
64642446042439 is an equidigital number, since it uses as much as digits as its factorization.
64642446042439 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 95551488, while the sum is 58.
The spelling of 64642446042439 in words is "sixty-four trillion, six hundred forty-two billion, four hundred forty-six million, forty-two thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •