Base | Representation |
---|---|
bin | 1100000111010101101100… |
… | …1011001000100100001101 |
3 | 1202011101211021000002120022 |
4 | 3001311123023020210031 |
5 | 3221214304121331341 |
6 | 44155120455431525 |
7 | 2543232356216645 |
oct | 301653313104415 |
9 | 52141737002508 |
10 | 13320223230221 |
11 | 42760908351a6 |
12 | 15b166b9855a5 |
13 | 7581264c072b |
14 | 3409b8d5b525 |
15 | 1817524a8e4b |
hex | c1d5b2c890d |
13320223230221 has 2 divisors, whose sum is σ = 13320223230222. Its totient is φ = 13320223230220.
The previous prime is 13320223230121. The next prime is 13320223230227. The reversal of 13320223230221 is 12203232202331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12031283080996 + 1288940149225 = 3468614^2 + 1135315^2 .
It is a cyclic number.
It is not a de Polignac number, because 13320223230221 - 210 = 13320223229197 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13320223230227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6660111615110 + 6660111615111.
It is an arithmetic number, because the mean of its divisors is an integer number (6660111615111).
Almost surely, 213320223230221 is an apocalyptic number.
It is an amenable number.
13320223230221 is a deficient number, since it is larger than the sum of its proper divisors (1).
13320223230221 is an equidigital number, since it uses as much as digits as its factorization.
13320223230221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 13320223230221 its reverse (12203232202331), we get a palindrome (25523455432552).
The spelling of 13320223230221 in words is "thirteen trillion, three hundred twenty billion, two hundred twenty-three million, two hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •