Base | Representation |
---|---|
bin | 1010001100000011001001… |
… | …1000111010110100000001 |
3 | 1110122220122000021122210120 |
4 | 2203000302120322310001 |
5 | 2432013420221213441 |
6 | 35454103302450453 |
7 | 2234216656534215 |
oct | 243006230726401 |
9 | 43586560248716 |
10 | 11202120101121 |
11 | 36298798384a4 |
12 | 130b067433a29 |
13 | 633480a4b521 |
14 | 2aa285056945 |
15 | 1465d5d16966 |
hex | a303263ad01 |
11202120101121 has 16 divisors (see below), whose sum is σ = 15340100277504. Its totient is φ = 7266116841984.
The previous prime is 11202120101027. The next prime is 11202120101143. The reversal of 11202120101121 is 12110102120211.
It is a happy number.
It is not a de Polignac number, because 11202120101121 - 233 = 11193530166529 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11202120101121.
It is not an unprimeable number, because it can be changed into a prime (11202120101521) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5962840 + ... + 7613126.
It is an arithmetic number, because the mean of its divisors is an integer number (958756267344).
Almost surely, 211202120101121 is an apocalyptic number.
It is an amenable number.
11202120101121 is a deficient number, since it is larger than the sum of its proper divisors (4137980176383).
11202120101121 is a wasteful number, since it uses less digits than its factorization.
11202120101121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1711480.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11202120101121 its reverse (12110102120211), we get a palindrome (23312222221332).
The spelling of 11202120101121 in words is "eleven trillion, two hundred two billion, one hundred twenty million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •