Search a number
-
+
71592665152 = 261923789941
BaseRepresentation
bin100001010101101000…
…0010110000001000000
320211210102020012201211
41002223100112001000
52133110210241102
652520023135504
75113063420201
oct1025320260100
9224712205654
1071592665152
11283a9213a68
1211a602a4594
13699c3b2978
14367235b5a8
151ce03617d7
hex10ab416040

71592665152 has 168 divisors, whose sum is σ = 155885494680. Its totient is φ = 32590356480.

The previous prime is 71592665107. The next prime is 71592665153. The reversal of 71592665152 is 25156629517.

It can be written as a sum of positive squares in 4 ways, for example, as 17367022656 + 54225642496 = 131784^2 + 232864^2 .

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

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

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

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

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

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

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

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

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

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

The product of its digits is 1134000, while the sum is 49.

The spelling of 71592665152 in words is "seventy-one billion, five hundred ninety-two million, six hundred sixty-five thousand, one hundred fifty-two".