Search a number
-
+
13151580988 = 22721331241131
BaseRepresentation
bin11000011111110010…
…10011001100111100
31020221120000112111011
430033321103030330
5203413301042423
610013004005004
7643623410500
oct141771231474
936846015434
1013151580988
1156397a74a7
122670530764
1313179053b0
148ca946300
1551e8e4b0d
hex30fe5333c

13151580988 has 216 divisors, whose sum is σ = 30752002512. Its totient is φ = 4874688000.

The previous prime is 13151580971. The next prime is 13151581007. The reversal of 13151580988 is 88908515131.

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

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

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 71 ways as a sum of consecutive naturals, for example, 100393683 + ... + 100393813.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 345600, while the sum is 49.

The spelling of 13151580988 in words is "thirteen billion, one hundred fifty-one million, five hundred eighty thousand, nine hundred eighty-eight".