Base | Representation |
---|---|
bin | 1010000001011101000101… |
… | …0100110101001101100101 |
3 | 1110000111210221000120010122 |
4 | 2200113101110311031211 |
5 | 2421023132332410341 |
6 | 35234322044531325 |
7 | 2215114266032321 |
oct | 240272124651545 |
9 | 43014727016118 |
10 | 11020103013221 |
11 | 3569665948325 |
12 | 129b92a250b45 |
13 | 61c264258b53 |
14 | 2a15393d4981 |
15 | 1419d14c294b |
hex | a05d1535365 |
11020103013221 has 2 divisors, whose sum is σ = 11020103013222. Its totient is φ = 11020103013220.
The previous prime is 11020103013209. The next prime is 11020103013317. The reversal of 11020103013221 is 12231030102011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11019312616225 + 790396996 = 3319535^2 + 28114^2 .
It is a cyclic number.
It is not a de Polignac number, because 11020103013221 - 210 = 11020103012197 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11020103013221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020103010221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510051506610 + 5510051506611.
It is an arithmetic number, because the mean of its divisors is an integer number (5510051506611).
Almost surely, 211020103013221 is an apocalyptic number.
It is an amenable number.
11020103013221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020103013221 is an equidigital number, since it uses as much as digits as its factorization.
11020103013221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 11020103013221 its reverse (12231030102011), we get a palindrome (23251133115232).
The spelling of 11020103013221 in words is "eleven trillion, twenty billion, one hundred three million, thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •