Search a number
-
+
664925243551 = 4364324048799
BaseRepresentation
bin10011010110100001010…
…00100000100010011111
32100120021210011011020021
421223100220200202133
541343231330243201
61225243515333011
766016316213242
oct11532050404237
92316253134207
10664925243551
11236aa1a68a78
12a8a4a151167
134a91890079a
142427acd9259
1512469babea1
hex9ad0a2089f

664925243551 has 8 divisors (see below), whose sum is σ = 681446796800. Its totient is φ = 648451789272.

The previous prime is 664925243513. The next prime is 664925243581. The reversal of 664925243551 is 155342529466.

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 664925243551 - 29 = 664925243039 is a prime.

It is a super-2 number, since 2×6649252435512 (a number of 24 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (664925243581) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11996751 + ... + 12052048.

It is an arithmetic number, because the mean of its divisors is an integer number (85180849600).

Almost surely, 2664925243551 is an apocalyptic number.

664925243551 is a deficient number, since it is larger than the sum of its proper divisors (16521553249).

664925243551 is a wasteful number, since it uses less digits than its factorization.

664925243551 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 24049485.

The product of its digits is 7776000, while the sum is 52.

The spelling of 664925243551 in words is "six hundred sixty-four billion, nine hundred twenty-five million, two hundred forty-three thousand, five hundred fifty-one".

Divisors: 1 43 643 27649 24048799 1034098357 15463377757 664925243551