Base | Representation |
---|---|
bin | 1011110000100010111… |
… | …1111000100010110101 |
3 | 201022102102220002202222 |
4 | 2330020233320202311 |
5 | 11302204104424023 |
6 | 232445140212125 |
7 | 20411000435441 |
oct | 2741057704265 |
9 | 638372802688 |
10 | 202010233013 |
11 | 78743567aa6 |
12 | 3319899a045 |
13 | 1608493a174 |
14 | 9ac5081821 |
15 | 53c4ba8cc8 |
hex | 2f08bf88b5 |
202010233013 has 6 divisors (see below), whose sum is σ = 213201936054. Its totient is φ = 191378115144.
The previous prime is 202010232989. The next prime is 202010233049. The reversal of 202010233013 is 310332010202.
It can be written as a sum of positive squares in only one way, i.e., 130829060209 + 71181172804 = 361703^2 + 266798^2 .
It is not a de Polignac number, because 202010233013 - 28 = 202010232757 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202010232982 and 202010233000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202010233093) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 279792206 + ... + 279792927.
It is an arithmetic number, because the mean of its divisors is an integer number (35533656009).
Almost surely, 2202010233013 is an apocalyptic number.
It is an amenable number.
202010233013 is a deficient number, since it is larger than the sum of its proper divisors (11191703041).
202010233013 is an equidigital number, since it uses as much as digits as its factorization.
202010233013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 559585171 (or 559585152 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 202010233013 its reverse (310332010202), we get a palindrome (512342243215).
The spelling of 202010233013 in words is "two hundred two billion, ten million, two hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •