Base | Representation |
---|---|
bin | 1001011100010011010110110… |
… | …1011001110001111111011001 |
3 | 10020010120121111202021002111201 |
4 | 2113010311231121301333121 |
5 | 1144042121121202232101 |
6 | 10313050223432554201 |
7 | 256645013262542062 |
oct | 22704655531617731 |
9 | 3203517452232451 |
10 | 664437571133401 |
11 | 18278a43406468a |
12 | 62630552252961 |
13 | 2269926a5bc650 |
14 | ba10d42c5d569 |
15 | 51c382cc81e01 |
hex | 25c4d6d671fd9 |
664437571133401 has 8 divisors (see below), whose sum is σ = 730772582327424. Its totient is φ = 600277478339280.
The previous prime is 664437571133359. The next prime is 664437571133669. The reversal of 664437571133401 is 104331175734466.
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 664437571133401 - 239 = 663887815319513 is a prime.
It is not an unprimeable number, because it can be changed into a prime (664437571133801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 543729599335 + ... + 543729600556.
It is an arithmetic number, because the mean of its divisors is an integer number (91346572790928).
Almost surely, 2664437571133401 is an apocalyptic number.
It is an amenable number.
664437571133401 is a deficient number, since it is larger than the sum of its proper divisors (66335011194023).
664437571133401 is a wasteful number, since it uses less digits than its factorization.
664437571133401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1087459199951.
The product of its (nonzero) digits is 15240960, while the sum is 55.
The spelling of 664437571133401 in words is "six hundred sixty-four trillion, four hundred thirty-seven billion, five hundred seventy-one million, one hundred thirty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •