Base | Representation |
---|---|
bin | 10000000001100100101… |
… | …100111001111111000101 |
3 | 10220021101121012001021220 |
4 | 100001210230321333011 |
5 | 121020224441334341 |
6 | 2201515041430553 |
7 | 142362535042455 |
oct | 20014454717705 |
9 | 3807347161256 |
10 | 1101201121221 |
11 | 395020363163 |
12 | 15950603b459 |
13 | 7cac58a2ba6 |
14 | 3b426c09d65 |
15 | 1d9a115da66 |
hex | 10064b39fc5 |
1101201121221 has 16 divisors (see below), whose sum is σ = 1486924185600. Its totient is φ = 724806948528.
The previous prime is 1101201121219. The next prime is 1101201121249. The reversal of 1101201121221 is 1221211021011.
It is a happy number.
It is not a de Polignac number, because 1101201121221 - 21 = 1101201121219 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1101201121221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101201121621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5515740 + ... + 5711898.
It is an arithmetic number, because the mean of its divisors is an integer number (92932761600).
Almost surely, 21101201121221 is an apocalyptic number.
It is an amenable number.
1101201121221 is a deficient number, since it is larger than the sum of its proper divisors (385723064379).
1101201121221 is a wasteful number, since it uses less digits than its factorization.
1101201121221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219928.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1101201121221 its reverse (1221211021011), we get a palindrome (2322412142232).
The spelling of 1101201121221 in words is "one trillion, one hundred one billion, two hundred one million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •