Base | Representation |
---|---|
bin | 1101111001000… |
… | …01101000100101 |
3 | 22010021022200212 |
4 | 12330201220211 |
5 | 214312422301 |
6 | 15321345205 |
7 | 2613325511 |
oct | 674415045 |
9 | 263238625 |
10 | 116529701 |
11 | 5a861542 |
12 | 33038205 |
13 | 1b1b04b2 |
14 | 11695141 |
15 | a36c4bb |
hex | 6f21a25 |
116529701 has 2 divisors, whose sum is σ = 116529702. Its totient is φ = 116529700.
The previous prime is 116529697. The next prime is 116529709. The reversal of 116529701 is 107925611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 106296100 + 10233601 = 10310^2 + 3199^2 .
It is a cyclic number.
It is not a de Polignac number, because 116529701 - 22 = 116529697 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116529709) 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, 58264850 + 58264851.
It is an arithmetic number, because the mean of its divisors is an integer number (58264851).
Almost surely, 2116529701 is an apocalyptic number.
It is an amenable number.
116529701 is a deficient number, since it is larger than the sum of its proper divisors (1).
116529701 is an equidigital number, since it uses as much as digits as its factorization.
116529701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780, while the sum is 32.
The square root of 116529701 is about 10794.8923570363. The cubic root of 116529701 is about 488.4411113307.
The spelling of 116529701 in words is "one hundred sixteen million, five hundred twenty-nine thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •