Search a number
-
+
10711153152 = 29337711559
BaseRepresentation
bin10011111100110111…
…10011101000000000
31000122110220221212000
421332123303220000
5133414023400102
64530505104000
7526301204520
oct117633635000
930573827760
1010711153152
1145a7191997
1220ab188000
13101913325b
147387a1680
1542a53501c
hex27e6f3a00

10711153152 has 320 divisors, whose sum is σ = 36769075200. Its totient is φ = 3015290880.

The previous prime is 10711153133. The next prime is 10711153163. The reversal of 10711153152 is 25135111701.

10711153152 is a `hidden beast` number, since 1 + 0 + 71 + 11 + 531 + 52 = 666.

10711153152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a super-3 number, since 3×107111531523 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6869749 + ... + 6871307.

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

Almost surely, 210711153152 is an apocalyptic number.

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

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

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

10711153152 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 1050, while the sum is 27.

Adding to 10711153152 its reverse (25135111701), we get a palindrome (35846264853).

The spelling of 10711153152 in words is "ten billion, seven hundred eleven million, one hundred fifty-three thousand, one hundred fifty-two".