Search a number
-
+
64189925106 = 2310698320851
BaseRepresentation
bin111011110010000001…
…001000011011110010
320010200111200001110120
4323302001020123302
52022430110100411
645253300511110
74431454234536
oct736201103362
9203614601416
1064189925106
112524a5a288a
12105350ab496
13608c819208
14316d125bc6
151a0a4e2106
hexef20486f2

64189925106 has 8 divisors (see below), whose sum is σ = 128379850224. Its totient is φ = 21396641700.

The previous prime is 64189925069. The next prime is 64189925141. The reversal of 64189925106 is 60152998146.

It is a sphenic number, since it is the product of 3 distinct primes.

64189925106 is an admirable number.

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

It is a Curzon number.

It is an unprimeable number.

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 3 ways as a sum of consecutive naturals, for example, 5349160420 + ... + 5349160431.

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

Almost surely, 264189925106 is an apocalyptic number.

64189925106 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 10698320856.

The product of its (nonzero) digits is 933120, while the sum is 51.

The spelling of 64189925106 in words is "sixty-four billion, one hundred eighty-nine million, nine hundred twenty-five thousand, one hundred six".

Divisors: 1 2 3 6 10698320851 21396641702 32094962553 64189925106