Base | Representation |
---|---|
bin | 111100000111101111… |
… | …101100010110111101 |
3 | 20011121220120221220221 |
4 | 330013233230112331 |
5 | 2024201414434123 |
6 | 45353401541341 |
7 | 4443501535423 |
oct | 740757542675 |
9 | 204556527827 |
10 | 64554452413 |
11 | 2541733a620 |
12 | 106171a4851 |
13 | 611a1ba849 |
14 | 31a56d5113 |
15 | 1a2c4ea25d |
hex | f07bec5bd |
64554452413 has 8 divisors (see below), whose sum is σ = 70684837920. Its totient is φ = 58467700080.
The previous prime is 64554452407. The next prime is 64554452467. The reversal of 64554452413 is 31425445546.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 64554452413 - 25 = 64554452381 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 64554452413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (64554452713) 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 in 7 ways as a sum of consecutive naturals, for example, 10905195 + ... + 10911112.
It is an arithmetic number, because the mean of its divisors is an integer number (8835604740).
Almost surely, 264554452413 is an apocalyptic number.
It is an amenable number.
64554452413 is a deficient number, since it is larger than the sum of its proper divisors (6130385507).
64554452413 is a wasteful number, since it uses less digits than its factorization.
64554452413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21816587.
The product of its digits is 1152000, while the sum is 43.
Adding to 64554452413 its reverse (31425445546), we get a palindrome (95979897959).
The spelling of 64554452413 in words is "sixty-four billion, five hundred fifty-four million, four hundred fifty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •