Base | Representation |
---|---|
bin | 1010001100100001010010… |
… | …0110100101100011111001 |
3 | 1110200200111211102110022121 |
4 | 2203020110212211203321 |
5 | 2432132002314132301 |
6 | 35501522143521241 |
7 | 2234624314235251 |
oct | 243102446454371 |
9 | 43620454373277 |
10 | 11210210302201 |
11 | 3632250514299 |
12 | 13107448b9221 |
13 | 63416cb83c61 |
14 | 2aa8116c0961 |
15 | 14690b1cd3a1 |
hex | a32149a58f9 |
11210210302201 has 2 divisors, whose sum is σ = 11210210302202. Its totient is φ = 11210210302200.
The previous prime is 11210210302171. The next prime is 11210210302217. The reversal of 11210210302201 is 10220301201211.
It is an a-pointer prime, because the next prime (11210210302217) can be obtained adding 11210210302201 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9995588096400 + 1214622205801 = 3161580^2 + 1102099^2 .
It is a cyclic number.
It is not a de Polignac number, because 11210210302201 - 213 = 11210210294009 is a prime.
It is not a weakly prime, because it can be changed into another prime (11210210302261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5605105151100 + 5605105151101.
It is an arithmetic number, because the mean of its divisors is an integer number (5605105151101).
Almost surely, 211210210302201 is an apocalyptic number.
It is an amenable number.
11210210302201 is a deficient number, since it is larger than the sum of its proper divisors (1).
11210210302201 is an equidigital number, since it uses as much as digits as its factorization.
11210210302201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11210210302201 its reverse (10220301201211), we get a palindrome (21430511503412).
The spelling of 11210210302201 in words is "eleven trillion, two hundred ten billion, two hundred ten million, three hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •