Base | Representation |
---|---|
bin | 1100000000100001001… |
… | …0111111010000000001 |
3 | 201201111020101012202001 |
4 | 3000020102333100001 |
5 | 11334444143004401 |
6 | 234434414024001 |
7 | 20622150612334 |
oct | 3001022772001 |
9 | 651436335661 |
10 | 206297625601 |
11 | 7a5436a4561 |
12 | 33b947a8001 |
13 | 165b8c64062 |
14 | 9db064661b |
15 | 557629c601 |
hex | 30084bf401 |
206297625601 has 4 divisors (see below), whose sum is σ = 210686936832. Its totient is φ = 201908314372.
The previous prime is 206297625559. The next prime is 206297625619. The reversal of 206297625601 is 106526792602.
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 a de Polignac number, because none of the positive numbers 2k-206297625601 is a prime.
It is a super-2 number, since 2×2062976256012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (206297625661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2194655545 + ... + 2194655638.
It is an arithmetic number, because the mean of its divisors is an integer number (52671734208).
Almost surely, 2206297625601 is an apocalyptic number.
It is an amenable number.
206297625601 is a deficient number, since it is larger than the sum of its proper divisors (4389311231).
206297625601 is an equidigital number, since it uses as much as digits as its factorization.
206297625601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4389311230.
The product of its (nonzero) digits is 544320, while the sum is 46.
The spelling of 206297625601 in words is "two hundred six billion, two hundred ninety-seven million, six hundred twenty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •