Search a number
-
+
10506413632 = 2611132233379
BaseRepresentation
bin10011100100011101…
…10010011001000000
31000010012200010000211
421302032302121000
5133004120214012
64454312523504
7521234020351
oct116216623100
930105603024
1010506413632
114501662080
1220526b0594
13cb58a9900
14719507d28
154175916a7
hex2723b2640

10506413632 has 168 divisors, whose sum is σ = 24799076640. Its totient is φ = 4377784320.

The previous prime is 10506413623. The next prime is 10506413663. The reversal of 10506413632 is 23631460501.

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

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

It is an unprimeable number.

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 27721219 + ... + 27721597.

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

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

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

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

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

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

The product of its (nonzero) digits is 12960, while the sum is 31.

The spelling of 10506413632 in words is "ten billion, five hundred six million, four hundred thirteen thousand, six hundred thirty-two".