Base | Representation |
---|---|
bin | 110010100011000… |
… | …1011110110111001 |
3 | 11101012112211120111 |
4 | 1211012023312321 |
5 | 11433201321444 |
6 | 440145424321 |
7 | 60013532665 |
oct | 14506136671 |
9 | 4335484514 |
10 | 1696120249 |
11 | 7a046327a |
12 | 3b403b0a1 |
13 | 21051b665 |
14 | 1213958a5 |
15 | 9dd89234 |
hex | 6518bdb9 |
1696120249 has 2 divisors, whose sum is σ = 1696120250. Its totient is φ = 1696120248.
The previous prime is 1696120247. The next prime is 1696120289. The reversal of 1696120249 is 9420216961.
It is an a-pointer prime, because the next prime (1696120289) can be obtained adding 1696120249 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1411354624 + 284765625 = 37568^2 + 16875^2 .
It is a cyclic number.
It is not a de Polignac number, because 1696120249 - 21 = 1696120247 is a prime.
Together with 1696120247, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1696120247) 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, 848060124 + 848060125.
It is an arithmetic number, because the mean of its divisors is an integer number (848060125).
Almost surely, 21696120249 is an apocalyptic number.
It is an amenable number.
1696120249 is a deficient number, since it is larger than the sum of its proper divisors (1).
1696120249 is an equidigital number, since it uses as much as digits as its factorization.
1696120249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 40.
The square root of 1696120249 is about 41183.9804899915. The cubic root of 1696120249 is about 1192.5745753384.
The spelling of 1696120249 in words is "one billion, six hundred ninety-six million, one hundred twenty thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •