Base | Representation |
---|---|
bin | 10011010101111110100… |
… | …01100011011001110101 |
3 | 2100112112111011010102201 |
4 | 21222333101203121311 |
5 | 41342132301411201 |
6 | 1225154553304501 |
7 | 66006151620406 |
oct | 11527721433165 |
9 | 2315474133381 |
10 | 664634013301 |
11 | 236962634415 |
12 | a8988705131 |
13 | 4a8a04835ab |
14 | 242503699ad |
15 | 1244e331801 |
hex | 9abf463675 |
664634013301 has 4 divisors (see below), whose sum is σ = 664638705472. Its totient is φ = 664629321132.
The previous prime is 664634013287. The next prime is 664634013341. The reversal of 664634013301 is 103310436466.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 664634013301 - 233 = 656044078709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (664634013341) 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 3 ways as a sum of consecutive naturals, for example, 2126781 + ... + 2419186.
It is an arithmetic number, because the mean of its divisors is an integer number (166159676368).
Almost surely, 2664634013301 is an apocalyptic number.
It is an amenable number.
664634013301 is a deficient number, since it is larger than the sum of its proper divisors (4692171).
664634013301 is a wasteful number, since it uses less digits than its factorization.
664634013301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4692170.
The product of its (nonzero) digits is 93312, while the sum is 37.
Adding to 664634013301 its reverse (103310436466), we get a palindrome (767944449767).
The spelling of 664634013301 in words is "six hundred sixty-four billion, six hundred thirty-four million, thirteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •