Search a number
-
+
10664892056 = 2371331612127
BaseRepresentation
bin10011110111010110…
…10101011010011000
31000112020212122120002
421323223111122120
5133320203021211
64522133352132
7525200041520
oct117353253230
930466778502
1010664892056
114583065285
122097798648
13100c686920
1473259c680
1542644803b
hex27bad5698

10664892056 has 192 divisors, whose sum is σ = 26031882240. Its totient is φ = 3984422400.

The previous prime is 10664892041. The next prime is 10664892061. The reversal of 10664892056 is 65029846601.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10664892056.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 83975465 + ... + 83975591.

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

Almost surely, 210664892056 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 622080, while the sum is 47.

The spelling of 10664892056 in words is "ten billion, six hundred sixty-four million, eight hundred ninety-two thousand, fifty-six".