Base | Representation |
---|---|
bin | 11011001000111110… |
… | …100100000000011111 |
3 | 2210012221011001221202 |
4 | 123020332210000133 |
5 | 434140230204031 |
6 | 21215410350115 |
7 | 2051104626053 |
oct | 331076440037 |
9 | 83187131852 |
10 | 29141647391 |
11 | 113a477800a |
12 | 579358b33b |
13 | 29955c104c |
14 | 15a644dc63 |
15 | b585c72cb |
hex | 6c8fa401f |
29141647391 has 2 divisors, whose sum is σ = 29141647392. Its totient is φ = 29141647390.
The previous prime is 29141647373. The next prime is 29141647399. The reversal of 29141647391 is 19374614192.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-29141647391 is a prime.
It is a super-2 number, since 2×291416473912 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (29141647399) 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 as a sum of consecutive naturals, namely, 14570823695 + 14570823696.
It is an arithmetic number, because the mean of its divisors is an integer number (14570823696).
Almost surely, 229141647391 is an apocalyptic number.
29141647391 is a deficient number, since it is larger than the sum of its proper divisors (1).
29141647391 is an equidigital number, since it uses as much as digits as its factorization.
29141647391 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 326592, while the sum is 47.
The spelling of 29141647391 in words is "twenty-nine billion, one hundred forty-one million, six hundred forty-seven thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •