Search a number
-
+
30641529 = 325494007
BaseRepresentation
bin111010011100…
…0110101111001
32010122202021110
41310320311321
530321012104
63012430533
7521306622
oct164706571
963582243
1030641529
1116329486
12a318449
13646aca9
1440d8a49
152a53e89
hex1d38d79

30641529 has 8 divisors (see below), whose sum is σ = 40881600. Its totient is φ = 20414576.

The previous prime is 30641519. The next prime is 30641563. The reversal of 30641529 is 92514603.

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 30641529 - 211 = 30639481 is a prime.

It is a Curzon number.

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

It is not an unprimeable number, because it can be changed into a prime (30641519) 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, 5644 + ... + 9650.

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

Almost surely, 230641529 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6559.

The product of its (nonzero) digits is 6480, while the sum is 30.

The square root of 30641529 is about 5535.4791120553. The cubic root of 30641529 is about 312.9225141376.

The spelling of 30641529 in words is "thirty million, six hundred forty-one thousand, five hundred twenty-nine".

Divisors: 1 3 2549 4007 7647 12021 10213843 30641529