Base | Representation |
---|---|
bin | 10011000000001100… |
… | …10101000101100001 |
3 | 222100000020210101021 |
4 | 21200012111011201 |
5 | 131343231102221 |
6 | 4404204405441 |
7 | 510551216311 |
oct | 114006250541 |
9 | 28300223337 |
10 | 10202206561 |
11 | 4365974878 |
12 | 1b88846881 |
13 | c67867c21 |
14 | 6cad5b441 |
15 | 3eaa01041 |
hex | 260195161 |
10202206561 has 4 divisors (see below), whose sum is σ = 10206890800. Its totient is φ = 10197522324.
The previous prime is 10202206559. The next prime is 10202206571. The reversal of 10202206561 is 16560220201.
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, and also an emirpimes, since its reverse is a distinct semiprime: 16560220201 = 7 ⋅2365745743.
It is a cyclic number.
It is not a de Polignac number, because 10202206561 - 21 = 10202206559 is a prime.
It is a super-2 number, since 2×102022065612 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10202206571) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2338851 + ... + 2343208.
It is an arithmetic number, because the mean of its divisors is an integer number (2551722700).
Almost surely, 210202206561 is an apocalyptic number.
It is an amenable number.
10202206561 is a deficient number, since it is larger than the sum of its proper divisors (4684239).
10202206561 is an equidigital number, since it uses as much as digits as its factorization.
10202206561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4684238.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 10202206561 its reverse (16560220201), we get a palindrome (26762426762).
The spelling of 10202206561 in words is "ten billion, two hundred two million, two hundred six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •