Search a number
-
+
29570451639 = 311038936371
BaseRepresentation
bin11011100010100010…
…010100100010110111
32211022211000120210120
4123202202110202313
5441030013423024
621330125223023
72064532456161
oct334242244267
984284016716
1029570451639
11115a4826a93
125893101a73
132a333a9281
141607391931
15b8107a479
hex6e28948b7

29570451639 has 8 divisors (see below), whose sum is σ = 39463018752. Its totient is φ = 19695759480.

The previous prime is 29570451629. The next prime is 29570451671. The reversal of 29570451639 is 93615407592.

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

It is not a de Polignac number, because 29570451639 - 213 = 29570443447 is a prime.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (29570451629) 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 7 ways as a sum of consecutive naturals, for example, 4464877 + ... + 4471494.

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

Almost surely, 229570451639 is an apocalyptic number.

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

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

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

The sum of its prime factors is 8937477.

The product of its (nonzero) digits is 2041200, while the sum is 51.

The spelling of 29570451639 in words is "twenty-nine billion, five hundred seventy million, four hundred fifty-one thousand, six hundred thirty-nine".

Divisors: 1 3 1103 3309 8936371 26809113 9856817213 29570451639