Base | Representation |
---|---|
bin | 1010010011100011010001… |
… | …0010100010100011101101 |
3 | 1111010020021221102210022222 |
4 | 2210320310102202203231 |
5 | 2441121342224032341 |
6 | 40033220123445125 |
7 | 2246431524241445 |
oct | 244706422424355 |
9 | 44106257383288 |
10 | 11331001002221 |
11 | 36794a5737aaa |
12 | 13300353867a5 |
13 | 64267cb16154 |
14 | 2b25cda51125 |
15 | 149b2a7c044b |
hex | a4e344a28ed |
11331001002221 has 2 divisors, whose sum is σ = 11331001002222. Its totient is φ = 11331001002220.
The previous prime is 11331001002199. The next prime is 11331001002259. The reversal of 11331001002221 is 12220010013311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7682847522025 + 3648153480196 = 2771795^2 + 1910014^2 .
It is a cyclic number.
It is not a de Polignac number, because 11331001002221 - 234 = 11313821133037 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11331001002221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11331001002721) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665500501110 + 5665500501111.
It is an arithmetic number, because the mean of its divisors is an integer number (5665500501111).
Almost surely, 211331001002221 is an apocalyptic number.
It is an amenable number.
11331001002221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331001002221 is an equidigital number, since it uses as much as digits as its factorization.
11331001002221 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 11331001002221 its reverse (12220010013311), we get a palindrome (23551011015532).
The spelling of 11331001002221 in words is "eleven trillion, three hundred thirty-one billion, one million, two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •