Base | Representation |
---|---|
bin | 100000000010000111111… |
… | …001000010110010000101 |
3 | 21210102221121012120022102 |
4 | 200002013321002302011 |
5 | 242031232100231232 |
6 | 4403133101441445 |
7 | 315016225622411 |
oct | 40020771026205 |
9 | 7712847176272 |
10 | 2201303133317 |
11 | 77962725a372 |
12 | 2b6763b70285 |
13 | 12c774847742 |
14 | 78787a69d41 |
15 | 3c3daa60662 |
hex | 20087e42c85 |
2201303133317 has 2 divisors, whose sum is σ = 2201303133318. Its totient is φ = 2201303133316.
The previous prime is 2201303133269. The next prime is 2201303133329. The reversal of 2201303133317 is 7133313031022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1183365406276 + 1017937727041 = 1087826^2 + 1008929^2 .
It is a cyclic number.
It is not a de Polignac number, because 2201303133317 - 28 = 2201303133061 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2201303133317.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2201303133377) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100651566658 + 1100651566659.
It is an arithmetic number, because the mean of its divisors is an integer number (1100651566659).
Almost surely, 22201303133317 is an apocalyptic number.
It is an amenable number.
2201303133317 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201303133317 is an equidigital number, since it uses as much as digits as its factorization.
2201303133317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 29.
Adding to 2201303133317 its reverse (7133313031022), we get a palindrome (9334616164339).
The spelling of 2201303133317 in words is "two trillion, two hundred one billion, three hundred three million, one hundred thirty-three thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •