Search a number
-
+
34925864064 = 27372131737227
BaseRepresentation
bin100000100001101111…
…100110010010000000
310100011001011201112220
4200201233212102000
51033012010122224
624013354251040
72344331642400
oct404157462200
9110131151486
1034925864064
11138a2815673
126928726a80
1333a7a67770
14199472c800
15d962d9279
hex821be6480

34925864064 has 768 divisors, whose sum is σ = 126938689920. Its totient is φ = 8397914112.

The previous prime is 34925864053. The next prime is 34925864107. The reversal of 34925864064 is 46046852943.

It is a Harshad number since it is a multiple of its sum of digits (51).

It is a junction number, because it is equal to n+sod(n) for n = 34925863998 and 34925864016.

It is an unprimeable number.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 153858319 + ... + 153858545.

Almost surely, 234925864064 is an apocalyptic number.

34925864064 is a gapful number since it is divisible by the number (34) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 34925864064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63469344960).

34925864064 is an abundant number, since it is smaller than the sum of its proper divisors (92012825856).

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

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

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

The sum of its prime factors is 325 (or 306 counting only the distinct ones).

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

The spelling of 34925864064 in words is "thirty-four billion, nine hundred twenty-five million, eight hundred sixty-four thousand, sixty-four".