Search a number
-
+
32540501521 = 1125471116141
BaseRepresentation
bin11110010011100100…
…001010011000010001
310002222210200202022001
4132103210022120101
51013120332022041
622540543514001
72231245461553
oct362344123021
9102883622261
1032540501521
11128892a0470
1263818b8901
1330b7805438
1418099dd4d3
15ca6ba5131
hex79390a611

32540501521 has 8 divisors (see below), whose sum is σ = 35500428288. Its totient is φ = 29580858000.

The previous prime is 32540501503. The next prime is 32540501527. The reversal of 32540501521 is 12510504523.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 32540501521 - 25 = 32540501489 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 32540501521.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 222111 + ... + 338251.

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

Almost surely, 232540501521 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 141623.

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

It can be divided in two parts, 32540 and 501521, that added together give a triangular number (534061 = T1033).

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

Divisors: 1 11 25471 116141 280181 1277551 2958227411 32540501521