Base | Representation |
---|---|
bin | 1100000001010000001… |
… | …0111100111110011001 |
3 | 201201222222022002121201 |
4 | 3000110002330332121 |
5 | 11340400123423234 |
6 | 234510135034201 |
7 | 20630063255014 |
oct | 3002402747631 |
9 | 651888262551 |
10 | 206494748569 |
11 | 7a6349a19aa |
12 | 3402a80b961 |
13 | 1661aa51975 |
14 | 9dcc8ba37b |
15 | 5588739314 |
hex | 30140bcf99 |
206494748569 has 2 divisors, whose sum is σ = 206494748570. Its totient is φ = 206494748568.
The previous prime is 206494748507. The next prime is 206494748573. The reversal of 206494748569 is 965847494602.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 206399393344 + 95355225 = 454312^2 + 9765^2 .
It is a cyclic number.
It is not a de Polignac number, because 206494748569 - 219 = 206494224281 is a prime.
It is a super-2 number, since 2×2064947485692 (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 206494748569.
It is not a weakly prime, because it can be changed into another prime (206494748599) 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, 103247374284 + 103247374285.
It is an arithmetic number, because the mean of its divisors is an integer number (103247374285).
Almost surely, 2206494748569 is an apocalyptic number.
It is an amenable number.
206494748569 is a deficient number, since it is larger than the sum of its proper divisors (1).
206494748569 is an equidigital number, since it uses as much as digits as its factorization.
206494748569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104509440, while the sum is 64.
The spelling of 206494748569 in words is "two hundred six billion, four hundred ninety-four million, seven hundred forty-eight thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •