Base | Representation |
---|---|
bin | 1100000010001010110… |
… | …0010110110111100001 |
3 | 201202122002200201122102 |
4 | 3000202230112313201 |
5 | 11341401030433203 |
6 | 234550354020145 |
7 | 20636136054362 |
oct | 3004254266741 |
9 | 652562621572 |
10 | 206740483553 |
11 | 7a75068226a |
12 | 34098b77655 |
13 | 1665992cc96 |
14 | a0133a5b69 |
15 | 55a00c9888 |
hex | 3022b16de1 |
206740483553 has 4 divisors (see below), whose sum is σ = 209826162480. Its totient is φ = 203654804628.
The previous prime is 206740483529. The next prime is 206740483559. The reversal of 206740483553 is 355384047602.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 206740483553 - 218 = 206740221409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 206740483498 and 206740483507.
It is not an unprimeable number, because it can be changed into a prime (206740483559) 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 in 3 ways as a sum of consecutive naturals, for example, 1542839363 + ... + 1542839496.
It is an arithmetic number, because the mean of its divisors is an integer number (52456540620).
Almost surely, 2206740483553 is an apocalyptic number.
It is an amenable number.
206740483553 is a deficient number, since it is larger than the sum of its proper divisors (3085678927).
206740483553 is an equidigital number, since it uses as much as digits as its factorization.
206740483553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3085678926.
The product of its (nonzero) digits is 2419200, while the sum is 47.
The spelling of 206740483553 in words is "two hundred six billion, seven hundred forty million, four hundred eighty-three thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •