Base | Representation |
---|---|
bin | 101001000110000… |
… | …111111101001111 |
3 | 1210001100202211111 |
4 | 221012013331033 |
5 | 2403001040221 |
6 | 152225432451 |
7 | 23041260304 |
oct | 5106077517 |
9 | 1701322744 |
10 | 689471311 |
11 | 324209001 |
12 | 172a9b727 |
13 | acac3cb9 |
14 | 677d70ab |
15 | 407e2be1 |
hex | 29187f4f |
689471311 has 2 divisors, whose sum is σ = 689471312. Its totient is φ = 689471310.
The previous prime is 689471291. The next prime is 689471351. The reversal of 689471311 is 113174986.
It is an a-pointer prime, because the next prime (689471351) can be obtained adding 689471311 to its sum of digits (40).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 689471311 - 213 = 689463119 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (689471351) 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, 344735655 + 344735656.
It is an arithmetic number, because the mean of its divisors is an integer number (344735656).
Almost surely, 2689471311 is an apocalyptic number.
689471311 is a deficient number, since it is larger than the sum of its proper divisors (1).
689471311 is an equidigital number, since it uses as much as digits as its factorization.
689471311 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 36288, while the sum is 40.
The square root of 689471311 is about 26257.7857215722. The cubic root of 689471311 is about 883.4298442393.
The spelling of 689471311 in words is "six hundred eighty-nine million, four hundred seventy-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •