Base | Representation |
---|---|
bin | 1010000000111000010001… |
… | …0011111100110111011001 |
3 | 1102222120022020021101110111 |
4 | 2200032010103330313121 |
5 | 2420342413034032301 |
6 | 35230005315044321 |
7 | 2214314353234501 |
oct | 240160423746731 |
9 | 42876266241414 |
10 | 11010221002201 |
11 | 35654547a1173 |
12 | 1299a308a06a1 |
13 | 61b34ab40155 |
14 | 2a0c7cbc6a01 |
15 | 141603b6e551 |
hex | a03844fcdd9 |
11010221002201 has 8 divisors (see below), whose sum is σ = 11658192208200. Its totient is φ = 10362284368128.
The previous prime is 11010221002141. The next prime is 11010221002219. The reversal of 11010221002201 is 10220012201011.
It can be written as a sum of positive squares in 4 ways, for example, as 2627806344601 + 8382414657600 = 1621051^2 + 2895240^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11010221002201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11010221008201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7985866 + ... + 9262531.
It is an arithmetic number, because the mean of its divisors is an integer number (1457274026025).
Almost surely, 211010221002201 is an apocalyptic number.
It is an amenable number.
11010221002201 is a deficient number, since it is larger than the sum of its proper divisors (647971205999).
11010221002201 is a wasteful number, since it uses less digits than its factorization.
11010221002201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17285963.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11010221002201 its reverse (10220012201011), we get a palindrome (21230233203212).
The spelling of 11010221002201 in words is "eleven trillion, ten billion, two hundred twenty-one million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •