Base | Representation |
---|---|
bin | 101101101111110110000111… |
… | …110110100100011001001001 |
3 | 222101101112102111010120002221 |
4 | 231233312013312210121021 |
5 | 202332430121141210441 |
6 | 1551530003022054041 |
7 | 60244136053643224 |
oct | 5557660766443111 |
9 | 871345374116087 |
10 | 201200022210121 |
11 | 591214a529a210 |
12 | 1a695ab441a321 |
13 | 8836108351c6c |
14 | 37981c10905bb |
15 | 183da1abb58d1 |
hex | b6fd87da4649 |
201200022210121 has 16 divisors (see below), whose sum is σ = 232597624896000. Its totient is φ = 172294536937600.
The previous prime is 201200022210043. The next prime is 201200022210127. The reversal of 201200022210121 is 121012220002102.
It is a happy number.
It is not a de Polignac number, because 201200022210121 - 213 = 201200022201929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201200022210095 and 201200022210104.
It is not an unprimeable number, because it can be changed into a prime (201200022210127) 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, 7691707321 + ... + 7691733478.
It is an arithmetic number, because the mean of its divisors is an integer number (14537351556000).
Almost surely, 2201200022210121 is an apocalyptic number.
It is an amenable number.
201200022210121 is a deficient number, since it is larger than the sum of its proper divisors (31397602685879).
201200022210121 is a wasteful number, since it uses less digits than its factorization.
201200022210121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15383440880.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 201200022210121 its reverse (121012220002102), we get a palindrome (322212242212223).
The spelling of 201200022210121 in words is "two hundred one trillion, two hundred billion, twenty-two million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •