Base | Representation |
---|---|
bin | 11011100000000101… |
… | …101101010001010111 |
3 | 2211012221202202110212 |
4 | 123200011231101113 |
5 | 440434011140221 |
6 | 21322101240035 |
7 | 2063523504302 |
oct | 334005552127 |
9 | 84187682425 |
10 | 29529396311 |
11 | 11583635568 |
12 | 588140301b |
13 | 2a27a3328c |
14 | 1601b45b39 |
15 | b7c66ab5b |
hex | 6e016d457 |
29529396311 has 8 divisors (see below), whose sum is σ = 29608951680. Its totient is φ = 29449916512.
The previous prime is 29529396293. The next prime is 29529396329. The reversal of 29529396311 is 11369392592.
It is an interprime number because it is at equal distance from previous prime (29529396293) and next prime (29529396329).
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 29529396311 - 226 = 29462287447 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 29529396311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29529390311) 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, 812321 + ... + 847893.
It is an arithmetic number, because the mean of its divisors is an integer number (3701118960).
Almost surely, 229529396311 is an apocalyptic number.
29529396311 is a deficient number, since it is larger than the sum of its proper divisors (79555369).
29529396311 is a wasteful number, since it uses less digits than its factorization.
29529396311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37785.
The product of its digits is 787320, while the sum is 50.
The spelling of 29529396311 in words is "twenty-nine billion, five hundred twenty-nine million, three hundred ninety-six thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •