Base | Representation |
---|---|
bin | 1001011100010001111001001… |
… | …0010110001100100000101111 |
3 | 10020010111012121000010101120201 |
4 | 2113010132102112030200233 |
5 | 1144041213114303143141 |
6 | 10313030504053254331 |
7 | 256643133114304441 |
oct | 22704362226144057 |
9 | 3203435530111521 |
10 | 664412421146671 |
11 | 18277a7a85a538a |
12 | 626276b36343a7 |
13 | 22696a8cc902b2 |
14 | ba0da389d2491 |
15 | 51c2d59d34031 |
hex | 25c479258c82f |
664412421146671 has 8 divisors (see below), whose sum is σ = 713403892135584. Its totient is φ = 616521882090240.
The previous prime is 664412421146647. The next prime is 664412421146687. The reversal of 664412421146671 is 176641124214466.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-664412421146671 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 (664412421146371) 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, 275232981870 + ... + 275232984283.
It is an arithmetic number, because the mean of its divisors is an integer number (89175486516948).
Almost surely, 2664412421146671 is an apocalyptic number.
664412421146671 is a deficient number, since it is larger than the sum of its proper divisors (48991470988913).
664412421146671 is a wasteful number, since it uses less digits than its factorization.
664412421146671 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550465966241.
The product of its digits is 9289728, while the sum is 55.
The spelling of 664412421146671 in words is "six hundred sixty-four trillion, four hundred twelve billion, four hundred twenty-one million, one hundred forty-six thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •