Base | Representation |
---|---|
bin | 1100000011010110110… |
… | …1111111101011011001 |
3 | 201210110100022120210121 |
4 | 3000311231333223121 |
5 | 11343024234224321 |
6 | 235042155313241 |
7 | 20650063145221 |
oct | 3006555775331 |
9 | 653410276717 |
10 | 207059679961 |
11 | 7a8a4878252 |
12 | 34167a4b821 |
13 | 166aaabc4b4 |
14 | a043935081 |
15 | 55bd12b441 |
hex | 3035b7fad9 |
207059679961 has 2 divisors, whose sum is σ = 207059679962. Its totient is φ = 207059679960.
The previous prime is 207059679947. The next prime is 207059679973. The reversal of 207059679961 is 169976950702.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104687838025 + 102371841936 = 323555^2 + 319956^2 .
It is a cyclic number.
It is not a de Polignac number, because 207059679961 - 217 = 207059548889 is a prime.
It is a super-2 number, since 2×2070596799612 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 207059679961.
It is not a weakly prime, because it can be changed into another prime (207059679661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 103529839980 + 103529839981.
It is an arithmetic number, because the mean of its divisors is an integer number (103529839981).
Almost surely, 2207059679961 is an apocalyptic number.
It is an amenable number.
207059679961 is a deficient number, since it is larger than the sum of its proper divisors (1).
207059679961 is an equidigital number, since it uses as much as digits as its factorization.
207059679961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12859560, while the sum is 61.
The spelling of 207059679961 in words is "two hundred seven billion, fifty-nine million, six hundred seventy-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •