Base | Representation |
---|---|
bin | 11011000110011101… |
… | …101110111110001001 |
3 | 2210002222211002220222 |
4 | 123012131232332021 |
5 | 434043432041423 |
6 | 21211302555425 |
7 | 2050053362564 |
oct | 330635567611 |
9 | 83088732828 |
10 | 29099487113 |
11 | 113829a1404 |
12 | 5781438b75 |
13 | 298994c138 |
14 | 15a09d74db |
15 | b54a4a3c8 |
hex | 6c676ef89 |
29099487113 has 2 divisors, whose sum is σ = 29099487114. Its totient is φ = 29099487112.
The previous prime is 29099487091. The next prime is 29099487133. The reversal of 29099487113 is 31178499092.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26428354624 + 2671132489 = 162568^2 + 51683^2 .
It is a cyclic number.
It is not a de Polignac number, because 29099487113 - 26 = 29099487049 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (29099487133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14549743556 + 14549743557.
It is an arithmetic number, because the mean of its divisors is an integer number (14549743557).
Almost surely, 229099487113 is an apocalyptic number.
It is an amenable number.
29099487113 is a deficient number, since it is larger than the sum of its proper divisors (1).
29099487113 is an equidigital number, since it uses as much as digits as its factorization.
29099487113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 979776, while the sum is 53.
The spelling of 29099487113 in words is "twenty-nine billion, ninety-nine million, four hundred eighty-seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •