Base | Representation |
---|---|
bin | 101101101111111000000011… |
… | …101101001010111000100001 |
3 | 222101101201210022002101010121 |
4 | 231233320003231022320201 |
5 | 202332443400112333441 |
6 | 1551530545131000241 |
7 | 60244241414620621 |
oct | 5557700355127041 |
9 | 871351708071117 |
10 | 201202100121121 |
11 | 59122371210530 |
12 | 1a696394299081 |
13 | 88363799a78b8 |
14 | 379833b02a881 |
15 | 183dadd317dd1 |
hex | b6fe03b4ae21 |
201202100121121 has 16 divisors (see below), whose sum is σ = 219554328130560. Its totient is φ = 182860065015120.
The previous prime is 201202100121109. The next prime is 201202100121203. The reversal of 201202100121121 is 121121001202102.
It is a cyclic number.
It is not a de Polignac number, because 201202100121121 - 213 = 201202100112929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201202100121095 and 201202100121104.
It is not an unprimeable number, because it can be changed into a prime (201202100121821) 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, 903440860 + ... + 903663538.
It is an arithmetic number, because the mean of its divisors is an integer number (13722145508160).
Almost surely, 2201202100121121 is an apocalyptic number.
It is an amenable number.
201202100121121 is a deficient number, since it is larger than the sum of its proper divisors (18352228009439).
201202100121121 is a wasteful number, since it uses less digits than its factorization.
201202100121121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245196.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201202100121121 its reverse (121121001202102), we get a palindrome (322323101323223).
The spelling of 201202100121121 in words is "two hundred one trillion, two hundred two billion, one hundred million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •