Base | Representation |
---|---|
bin | 1010010001110100010101… |
… | …1001101010101101001001 |
3 | 1111000101102200110101220211 |
4 | 2210131011121222231021 |
5 | 2440124401131442301 |
6 | 40011413232321121 |
7 | 2244325564116604 |
oct | 244350531525511 |
9 | 44011380411824 |
10 | 11301223312201 |
11 | 3667904a34829 |
12 | 13263049a31a1 |
13 | 63c91581a024 |
14 | 2b0da6d5533b |
15 | 148e8645b051 |
hex | a474566ab49 |
11301223312201 has 2 divisors, whose sum is σ = 11301223312202. Its totient is φ = 11301223312200.
The previous prime is 11301223312193. The next prime is 11301223312213. The reversal of 11301223312201 is 10221332210311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8725519302201 + 2575704010000 = 2953899^2 + 1604900^2 .
It is a cyclic number.
It is not a de Polignac number, because 11301223312201 - 23 = 11301223312193 is a prime.
It is a super-2 number, since 2×113012233122012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11301223312261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5650611656100 + 5650611656101.
It is an arithmetic number, because the mean of its divisors is an integer number (5650611656101).
Almost surely, 211301223312201 is an apocalyptic number.
It is an amenable number.
11301223312201 is a deficient number, since it is larger than the sum of its proper divisors (1).
11301223312201 is an equidigital number, since it uses as much as digits as its factorization.
11301223312201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11301223312201 its reverse (10221332210311), we get a palindrome (21522555522512).
The spelling of 11301223312201 in words is "eleven trillion, three hundred one billion, two hundred twenty-three million, three hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •