Search a number
-
+
13127167152 = 2436111011013
BaseRepresentation
bin11000011100111000…
…01010110010110000
31020212212002012000000
430032130022302300
5203341023322102
610010332430000
7643206036231
oct141634126260
936785065000
1013127167152
115626a41a80
122664318300
131312837c38
148c75cd088
1551c6c101c
hex30e70acb0

13127167152 has 280 divisors, whose sum is σ = 42053411088. Its totient is φ = 3934656000.

The previous prime is 13127167139. The next prime is 13127167153. The reversal of 13127167152 is 25176172131.

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

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

It is not an unprimeable number, because it can be changed into a prime (13127167153) by changing a digit.

It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 12958198 + ... + 12959210.

Almost surely, 213127167152 is an apocalyptic number.

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

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

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

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

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

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

The product of its digits is 17640, while the sum is 36.

The spelling of 13127167152 in words is "thirteen billion, one hundred twenty-seven million, one hundred sixty-seven thousand, one hundred fifty-two".