Base | Representation |
---|---|
bin | 10100000011100011100… |
… | …01011001010000010111 |
3 | 2102212200210212221102102 |
4 | 22001301301121100113 |
5 | 42242241001310041 |
6 | 1244323024232315 |
7 | 100533425312165 |
oct | 12016161312027 |
9 | 2385623787372 |
10 | 689103541271 |
11 | 246279a90a02 |
12 | b167746b69b |
13 | 4cc9cb25c22 |
14 | 254d20a8235 |
15 | 12dd266c09b |
hex | a071c59417 |
689103541271 has 2 divisors, whose sum is σ = 689103541272. Its totient is φ = 689103541270.
The previous prime is 689103541253. The next prime is 689103541411. The reversal of 689103541271 is 172145301986.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 689103541271 - 222 = 689099346967 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (689103541241) 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, 344551770635 + 344551770636.
It is an arithmetic number, because the mean of its divisors is an integer number (344551770636).
It is a 1-persistent number, because it is pandigital, but 2⋅689103541271 = 1378207082542 is not.
Almost surely, 2689103541271 is an apocalyptic number.
689103541271 is a deficient number, since it is larger than the sum of its proper divisors (1).
689103541271 is an equidigital number, since it uses as much as digits as its factorization.
689103541271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 47.
The spelling of 689103541271 in words is "six hundred eighty-nine billion, one hundred three million, five hundred forty-one thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •