Base | Representation |
---|---|
bin | 1011000110010100100010… |
… | …1110000011101101100001 |
3 | 1121012121122112100111210021 |
4 | 2301211020232003231201 |
5 | 3044414144330340223 |
6 | 41542025521233441 |
7 | 2366440135362136 |
oct | 261451056035541 |
9 | 47177575314707 |
10 | 12203222121313 |
11 | 39853a2828483 |
12 | 1451096492881 |
13 | 6a69b3424402 |
14 | 3028d39a658d |
15 | 1626791b265d |
hex | b1948b83b61 |
12203222121313 has 2 divisors, whose sum is σ = 12203222121314. Its totient is φ = 12203222121312.
The previous prime is 12203222121217. The next prime is 12203222121331. The reversal of 12203222121313 is 31312122230221.
Together with next prime (12203222121331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9834602624289 + 2368619497024 = 3136017^2 + 1539032^2 .
It is a cyclic number.
It is not a de Polignac number, because 12203222121313 - 241 = 10004198865761 is a prime.
It is not a weakly prime, because it can be changed into another prime (12203222121383) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101611060656 + 6101611060657.
It is an arithmetic number, because the mean of its divisors is an integer number (6101611060657).
Almost surely, 212203222121313 is an apocalyptic number.
It is an amenable number.
12203222121313 is a deficient number, since it is larger than the sum of its proper divisors (1).
12203222121313 is an equidigital number, since it uses as much as digits as its factorization.
12203222121313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 12203222121313 its reverse (31312122230221), we get a palindrome (43515344351534).
The spelling of 12203222121313 in words is "twelve trillion, two hundred three billion, two hundred twenty-two million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •