Base | Representation |
---|---|
bin | 1010000000111111101001… |
… | …0101100000010111000101 |
3 | 1102222202102020012212002222 |
4 | 2200033322111200113011 |
5 | 2420410441441334341 |
6 | 35230534011542125 |
7 | 2214414416044316 |
oct | 240177225402705 |
9 | 42882366185088 |
10 | 11012201121221 |
11 | 3566280499973 |
12 | 129a2a3a5a945 |
13 | 61b5a5146301 |
14 | 2a0dc9b8860d |
15 | 1416bc90644b |
hex | a03fa5605c5 |
11012201121221 has 2 divisors, whose sum is σ = 11012201121222. Its totient is φ = 11012201121220.
The previous prime is 11012201121211. The next prime is 11012201121289. The reversal of 11012201121221 is 12212110221011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7078999888321 + 3933201232900 = 2660639^2 + 1983230^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012201121221 - 210 = 11012201120197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11012201121221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012201121211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506100560610 + 5506100560611.
It is an arithmetic number, because the mean of its divisors is an integer number (5506100560611).
Almost surely, 211012201121221 is an apocalyptic number.
It is an amenable number.
11012201121221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012201121221 is an equidigital number, since it uses as much as digits as its factorization.
11012201121221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11012201121221 its reverse (12212110221011), we get a palindrome (23224311342232).
The spelling of 11012201121221 in words is "eleven trillion, twelve 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.075 sec. • engine limits •