Search a number
-
+
10916152 = 2313432441
BaseRepresentation
bin101001101001…
…000100111000
3202112121010221
4221221010320
510243304102
61025545424
7161533342
oct51510470
922477127
1010916152
116186515
1237a5274
132352880
141642292
15e59637
hexa69138

10916152 has 32 divisors (see below), whose sum is σ = 22564080. Its totient is φ = 4919040.

The previous prime is 10916149. The next prime is 10916161. The reversal of 10916152 is 25161901.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3252 + ... + 5692.

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

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

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

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

10916152 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 540, while the sum is 25.

The square root of 10916152 is about 3303.9600481846. The cubic root of 10916152 is about 221.8314875196.

It can be divided in two parts, 109 and 16152, that added together give a palindrome (16261).

The spelling of 10916152 in words is "ten million, nine hundred sixteen thousand, one hundred fifty-two".

Divisors: 1 2 4 8 13 26 43 52 86 104 172 344 559 1118 2236 2441 4472 4882 9764 19528 31733 63466 104963 126932 209926 253864 419852 839704 1364519 2729038 5458076 10916152