Base | Representation |
---|---|
bin | 1100000001000011010… |
… | …0100110100111111001 |
3 | 201201212012111212200021 |
4 | 3000100310212213321 |
5 | 11340242301432403 |
6 | 234500523410441 |
7 | 20625535421602 |
oct | 3002064464771 |
9 | 651765455607 |
10 | 206440655353 |
11 | 7a607405969 |
12 | 34014683a21 |
13 | 1660c79244a |
14 | 9dc5638da9 |
15 | 5583b018bd |
hex | 3010d269f9 |
206440655353 has 2 divisors, whose sum is σ = 206440655354. Its totient is φ = 206440655352.
The previous prime is 206440655299. The next prime is 206440655389. The reversal of 206440655353 is 353556044602.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 158092121664 + 48348533689 = 397608^2 + 219883^2 .
It is a cyclic number.
It is not a de Polignac number, because 206440655353 - 29 = 206440654841 is a prime.
It is a super-2 number, since 2×2064406553532 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (206440655453) 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, 103220327676 + 103220327677.
It is an arithmetic number, because the mean of its divisors is an integer number (103220327677).
Almost surely, 2206440655353 is an apocalyptic number.
It is an amenable number.
206440655353 is a deficient number, since it is larger than the sum of its proper divisors (1).
206440655353 is an equidigital number, since it uses as much as digits as its factorization.
206440655353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296000, while the sum is 43.
Adding to 206440655353 its reverse (353556044602), we get a palindrome (559996699955).
The spelling of 206440655353 in words is "two hundred six billion, four hundred forty million, six hundred fifty-five thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •