Search a number
-
+
11212692064 = 2573161103257
BaseRepresentation
bin10100111000101010…
…00001101001100000
31001221102122202220021
422130111001221200
5140430422121224
65052342523224
7544601211220
oct123425015140
931842582807
1011212692064
1148342aa562
12220b136514
131099006942
14785238080
154595a41e4
hex29c541a60

11212692064 has 192 divisors, whose sum is σ = 26830282752. Its totient is φ = 4512153600.

The previous prime is 11212692061. The next prime is 11212692103. The reversal of 11212692064 is 46029621211.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11212692061) 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 31 ways as a sum of consecutive naturals, for example, 43629024 + ... + 43629280.

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

Almost surely, 211212692064 is an apocalyptic number.

11212692064 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 11212692064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13415141376).

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

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

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

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

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

The product of its (nonzero) digits is 10368, while the sum is 34.

The spelling of 11212692064 in words is "eleven billion, two hundred twelve million, six hundred ninety-two thousand, sixty-four".