Search a number
-
+
25387927152 = 24373173173193
BaseRepresentation
bin10111101001001111…
…010000011001110000
32102112022212022211020
4113221033100121300
5403443302132102
615355115215440
71556064551220
oct275117203160
972468768736
1025387927152
11a848906485
124b06447580
132517a0b903
14132bac8080
159d8c9dbbc
hex5e93d0670

25387927152 has 320 divisors, whose sum is σ = 79294734336. Its totient is φ = 6847856640.

The previous prime is 25387927099. The next prime is 25387927153. The reversal of 25387927152 is 25172978352.

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

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

It is a congruent number.

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

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 63 ways as a sum of consecutive naturals, for example, 131543568 + ... + 131543760.

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

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

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

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

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

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

The product of its digits is 2116800, while the sum is 51.

The spelling of 25387927152 in words is "twenty-five billion, three hundred eighty-seven million, nine hundred twenty-seven thousand, one hundred fifty-two".