Base | Representation |
---|---|
bin | 1100000111011101001011… |
… | …0011000111011011111101 |
3 | 1202011121000010110201121121 |
4 | 3001313102303013123331 |
5 | 3221232411412400221 |
6 | 44200051552030541 |
7 | 2543333166200656 |
oct | 301672263073375 |
9 | 52147003421547 |
10 | 13322230200061 |
11 | 4276a20702362 |
12 | 15b1b2bb32451 |
13 | 758386238353 |
14 | 340b2970c52d |
15 | 18181d796a41 |
hex | c1dd2cc76fd |
13322230200061 has 2 divisors, whose sum is σ = 13322230200062. Its totient is φ = 13322230200060.
The previous prime is 13322230199969. The next prime is 13322230200073. The reversal of 13322230200061 is 16000203222331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11163149676900 + 2159080523161 = 3341130^2 + 1469381^2 .
It is a cyclic number.
It is not a de Polignac number, because 13322230200061 - 29 = 13322230199549 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13322230199999 and 13322230200035.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13322230200661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6661115100030 + 6661115100031.
It is an arithmetic number, because the mean of its divisors is an integer number (6661115100031).
Almost surely, 213322230200061 is an apocalyptic number.
It is an amenable number.
13322230200061 is a deficient number, since it is larger than the sum of its proper divisors (1).
13322230200061 is an equidigital number, since it uses as much as digits as its factorization.
13322230200061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 13322230200061 its reverse (16000203222331), we get a palindrome (29322433422392).
The spelling of 13322230200061 in words is "thirteen trillion, three hundred twenty-two billion, two hundred thirty million, two hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •