Search a number
-
+
10131999660 = 223251719229761
BaseRepresentation
bin10010110111110101…
…00000101110101100
3222011010010220121200
421123322200232230
5131222242442120
64353215525500
7506036401416
oct113372405654
928133126550
1010131999660
11432a282342
121b69229890
13c56156193
146c18c39b6
153e4783e90
hex25bea0bac

10131999660 has 288 divisors, whose sum is σ = 34449105600. Its totient is φ = 2395422720.

The previous prime is 10131999659. The next prime is 10131999737. The reversal of 10131999660 is 6699913101.

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

It is a Harshad number since it is a multiple of its sum of digits (45).

It is an unprimeable number.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 13313680 + ... + 13314440.

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

Almost surely, 210131999660 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 10131999660 in words is "ten billion, one hundred thirty-one million, nine hundred ninety-nine thousand, six hundred sixty".