Search a number
-
+
11472749064 = 233373179109
BaseRepresentation
bin10101010111101010…
…00100001000001000
31002121120000001001000
422223311010020020
5141444010432224
65134232455000
7554206521000
oct125365041010
932546001030
1011472749064
1149580821a7
12228224a460
13110ab5ab1a
147ab9b1000
154723230c9
hex2abd44208

11472749064 has 256 divisors, whose sum is σ = 39355200000. Its totient is φ = 3084770304.

The previous prime is 11472749023. The next prime is 11472749069. The reversal of 11472749064 is 46094727411.

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

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 63 ways as a sum of consecutive naturals, for example, 1254942 + ... + 1264050.

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

Almost surely, 211472749064 is an apocalyptic number.

11472749064 is a gapful number since it is divisible by the number (14) 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 11472749064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19677600000).

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

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

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

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

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

The product of its (nonzero) digits is 338688, while the sum is 45.

The spelling of 11472749064 in words is "eleven billion, four hundred seventy-two million, seven hundred forty-nine thousand, sixty-four".