Base | Representation |
---|---|
bin | 10111000000101011111001… |
… | …001100011101000111011001 |
3 | 111021022211120100010101212021 |
4 | 113000223321030131013121 |
5 | 101231044101224020441 |
6 | 555123352101414441 |
7 | 30213421602332230 |
oct | 2700537114350731 |
9 | 437284510111767 |
10 | 101202200220121 |
11 | 2a278680763200 |
12 | b4257b810a421 |
13 | 446143250b540 |
14 | 1adc2d9633b17 |
15 | ba777c71c3d1 |
hex | 5c0af931d1d9 |
101202200220121 has 24 divisors (see below), whose sum is σ = 136909270242752. Its totient is φ = 72792791359200.
The previous prime is 101202200220113. The next prime is 101202200220131. The reversal of 101202200220121 is 121022002202101.
It is a happy number.
It is not a de Polignac number, because 101202200220121 - 23 = 101202200220113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101202200220095 and 101202200220104.
It is not an unprimeable number, because it can be changed into a prime (101202200220101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4595493495 + ... + 4595515516.
Almost surely, 2101202200220121 is an apocalyptic number.
101202200220121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101202200220121 is a deficient number, since it is larger than the sum of its proper divisors (35707070022631).
101202200220121 is a wasteful number, since it uses less digits than its factorization.
101202200220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9191009053 (or 9191009042 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 101202200220121 its reverse (121022002202101), we get a palindrome (222224202422222).
The spelling of 101202200220121 in words is "one hundred one trillion, two hundred two billion, two hundred million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.146 sec. • engine limits •