Base | Representation |
---|---|
bin | 10011111010100011… |
… | …10101000111110111 |
3 | 1000121010102201022111 |
4 | 21331101311013313 |
5 | 133344042320011 |
6 | 4524533311451 |
7 | 525644315536 |
oct | 117521650767 |
9 | 30533381274 |
10 | 10691760631 |
11 | 4597247012 |
12 | 20a4795587 |
13 | 10151034a6 |
14 | 735d9431d |
15 | 4289a4121 |
hex | 27d4751f7 |
10691760631 has 2 divisors, whose sum is σ = 10691760632. Its totient is φ = 10691760630.
The previous prime is 10691760613. The next prime is 10691760701. The reversal of 10691760631 is 13606719601.
Together with previous prime (10691760613) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (13606719601) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10691760631 - 213 = 10691752439 is a prime.
It is a super-2 number, since 2×106917606312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10691770631) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5345880315 + 5345880316.
It is an arithmetic number, because the mean of its divisors is an integer number (5345880316).
Almost surely, 210691760631 is an apocalyptic number.
10691760631 is a deficient number, since it is larger than the sum of its proper divisors (1).
10691760631 is an equidigital number, since it uses as much as digits as its factorization.
10691760631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824, while the sum is 40.
The spelling of 10691760631 in words is "ten billion, six hundred ninety-one million, seven hundred sixty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •