Base | Representation |
---|---|
bin | 101101111011101000101010… |
… | …111011011010111111101001 |
3 | 222111020222200000012021200220 |
4 | 231323220222323122333221 |
5 | 202434213403234121301 |
6 | 1553350113225320253 |
7 | 60356520241464324 |
oct | 5573505273327751 |
9 | 874228600167626 |
10 | 202010212020201 |
11 | 59404060321052 |
12 | 1a7a6b23336089 |
13 | 8894634415c50 |
14 | 37c54bc8677bb |
15 | 1854b3885a936 |
hex | b7ba2aedafe9 |
202010212020201 has 64 divisors (see below), whose sum is σ = 295139767910400. Its totient is φ = 122155778223360.
The previous prime is 202010212020161. The next prime is 202010212020229. The reversal of 202010212020201 is 102020212010202.
It is not a de Polignac number, because 202010212020201 - 219 = 202010211495913 is a prime.
It is not an unprimeable number, because it can be changed into a prime (202010212020601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5316458935 + ... + 5316496931.
It is an arithmetic number, because the mean of its divisors is an integer number (4611558873600).
Almost surely, 2202010212020201 is an apocalyptic number.
It is an amenable number.
202010212020201 is a deficient number, since it is larger than the sum of its proper divisors (93129555890199).
202010212020201 is a wasteful number, since it uses less digits than its factorization.
202010212020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46886.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 202010212020201 its reverse (102020212010202), we get a palindrome (304030424030403).
Subtracting from 202010212020201 its reverse (102020212010202), we obtain a palindrome (99990000009999).
The spelling of 202010212020201 in words is "two hundred two trillion, ten billion, two hundred twelve million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.593 sec. • engine limits •