Base | Representation |
---|---|
bin | 1100000001100000110100… |
… | …1010001100101101101101 |
3 | 1201210211110121010222102222 |
4 | 3000120031022030231231 |
5 | 3213044311302130123 |
6 | 44041124404525125 |
7 | 2533060101610535 |
oct | 300301512145555 |
9 | 51724417128388 |
10 | 13220130114413 |
11 | 423769788a892 |
12 | 15961969b07a5 |
13 | 74b86460aaa1 |
14 | 339c017bc4c5 |
15 | 17dd44ec96c8 |
hex | c060d28cb6d |
13220130114413 has 2 divisors, whose sum is σ = 13220130114414. Its totient is φ = 13220130114412.
The previous prime is 13220130114407. The next prime is 13220130114449. The reversal of 13220130114413 is 31441103102231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12342841244644 + 877288869769 = 3513238^2 + 936637^2 .
It is a cyclic number.
It is not a de Polignac number, because 13220130114413 - 24 = 13220130114397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13220130114463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6610065057206 + 6610065057207.
It is an arithmetic number, because the mean of its divisors is an integer number (6610065057207).
Almost surely, 213220130114413 is an apocalyptic number.
It is an amenable number.
13220130114413 is a deficient number, since it is larger than the sum of its proper divisors (1).
13220130114413 is an equidigital number, since it uses as much as digits as its factorization.
13220130114413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 13220130114413 its reverse (31441103102231), we get a palindrome (44661233216644).
The spelling of 13220130114413 in words is "thirteen trillion, two hundred twenty billion, one hundred thirty million, one hundred fourteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •