Base | Representation |
---|---|
bin | 101101111011100000001011… |
… | …111011100010010111101001 |
3 | 222111020010011010010102200121 |
4 | 231323200023323202113221 |
5 | 202434041224104201441 |
6 | 1553342005234403241 |
7 | 60356045422000213 |
oct | 5573401373422751 |
9 | 874203133112617 |
10 | 202001102022121 |
11 | 59400205a2a716 |
12 | 1a7a5200430521 |
13 | 8893811c3143c |
14 | 37c4c969bb5b3 |
15 | 18547a3ba1dd1 |
hex | b7b80bee25e9 |
202001102022121 has 16 divisors (see below), whose sum is σ = 209041447507200. Its totient is φ = 195065123011200.
The previous prime is 202001102022103. The next prime is 202001102022131. The reversal of 202001102022121 is 121220201100202.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 202001102022121 - 215 = 202001101989353 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202001102022095 and 202001102022104.
It is not an unprimeable number, because it can be changed into a prime (202001102022131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18935841 + ... + 27614638.
It is an arithmetic number, because the mean of its divisors is an integer number (13065090469200).
Almost surely, 2202001102022121 is an apocalyptic number.
It is an amenable number.
202001102022121 is a deficient number, since it is larger than the sum of its proper divisors (7040345485079).
202001102022121 is a wasteful number, since it uses less digits than its factorization.
202001102022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46551600.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 202001102022121 its reverse (121220201100202), we get a palindrome (323221303122323).
The spelling of 202001102022121 in words is "two hundred two trillion, one billion, one hundred two million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •