Base | Representation |
---|---|
bin | 101101111011101001011011… |
… | …000110000010110101100001 |
3 | 222111021001202022202120011012 |
4 | 231323221123012002311201 |
5 | 202434222032122024301 |
6 | 1553350325333430305 |
7 | 60356546253236630 |
oct | 5573513306026541 |
9 | 874231668676135 |
10 | 202011020111201 |
11 | 59404435488854 |
12 | 1a7a7109a9b395 |
13 | 889473296c7c2 |
14 | 37c5557cdb517 |
15 | 1854b8477eebb |
hex | b7ba5b182d61 |
202011020111201 has 8 divisors (see below), whose sum is σ = 232912832290944. Its totient is φ = 171619981686720.
The previous prime is 202011020111107. The next prime is 202011020111231. The reversal of 202011020111201 is 102111020110202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 202011020111201 - 218 = 202011019849057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202011020111231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 127693437965 + ... + 127693439546.
It is an arithmetic number, because the mean of its divisors is an integer number (29114104036368).
Almost surely, 2202011020111201 is an apocalyptic number.
It is an amenable number.
202011020111201 is a deficient number, since it is larger than the sum of its proper divisors (30901812179743).
202011020111201 is a wasteful number, since it uses less digits than its factorization.
202011020111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255386877631.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 202011020111201 its reverse (102111020110202), we get a palindrome (304122040221403).
Subtracting from 202011020111201 its reverse (102111020110202), we obtain a palindrome (99900000000999).
The spelling of 202011020111201 in words is "two hundred two trillion, eleven billion, twenty million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •