Search a number
-
+
32540151025 = 522356591567
BaseRepresentation
bin11110010011100010…
…110100110011110001
310002222210000221111201
4132103202310303301
51013120234313100
622540532211201
72231242501654
oct362342646361
9102883027451
1032540151025
11128890810a8
126381769b01
1330b7711a45
14180994b89b
15ca6b3636a
hex7938b4cf1

32540151025 has 12 divisors (see below), whose sum is σ = 42104126592. Its totient is φ = 24900289040.

The previous prime is 32540151019. The next prime is 32540151037. The reversal of 32540151025 is 52015104523.

It is a de Polignac number, because none of the positive numbers 2k-32540151025 is a prime.

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

It is a Duffinian number.

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

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 11 ways as a sum of consecutive naturals, for example, 28295209 + ... + 28296358.

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

Almost surely, 232540151025 is an apocalyptic number.

It is an amenable number.

32540151025 is a deficient number, since it is larger than the sum of its proper divisors (9563975567).

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

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

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

The product of its (nonzero) digits is 6000, while the sum is 28.

Adding to 32540151025 its reverse (52015104523), we get a palindrome (84555255548).

The spelling of 32540151025 in words is "thirty-two billion, five hundred forty million, one hundred fifty-one thousand, twenty-five".

Divisors: 1 5 23 25 115 575 56591567 282957835 1301606041 1414789175 6508030205 32540151025