Base | Representation |
---|---|
bin | 110111011011… |
… | …0011000001001 |
3 | 2000200022212022 |
4 | 1232312120021 |
5 | 24414333234 |
6 | 2514454225 |
7 | 501664601 |
oct | 156663011 |
9 | 60608768 |
10 | 29058569 |
11 | 15448151 |
12 | 9894375 |
13 | 6035627 |
14 | 3c05c01 |
15 | 283ee2e |
hex | 1bb6609 |
29058569 has 2 divisors, whose sum is σ = 29058570. Its totient is φ = 29058568.
The previous prime is 29058539. The next prime is 29058571. The reversal of 29058569 is 96585092.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18593344 + 10465225 = 4312^2 + 3235^2 .
It is a cyclic number.
It is not a de Polignac number, because 29058569 - 28 = 29058313 is a prime.
It is a super-2 number, since 2×290585692 = 1688800864655522, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 29058571, it forms a pair of twin primes.
It is a Chen prime.
It is an alternating number because its digits alternate between even and odd.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (29058529) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14529284 + 14529285.
It is an arithmetic number, because the mean of its divisors is an integer number (14529285).
Almost surely, 229058569 is an apocalyptic number.
It is an amenable number.
29058569 is a deficient number, since it is larger than the sum of its proper divisors (1).
29058569 is an equidigital number, since it uses as much as digits as its factorization.
29058569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 194400, while the sum is 44.
The square root of 29058569 is about 5390.6000593626. The cubic root of 29058569 is about 307.4383739724.
The spelling of 29058569 in words is "twenty-nine million, fifty-eight thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •