Base | Representation |
---|---|
bin | 1011111011010001110110… |
… | …1011111110101101100101 |
3 | 1201102121000211110012101122 |
4 | 2332310131223332231211 |
5 | 3204320443001114023 |
6 | 43520013322503325 |
7 | 2522246121215543 |
oct | 276643553765545 |
9 | 51377024405348 |
10 | 13113033223013 |
11 | 41a622a442189 |
12 | 1579488364b45 |
13 | 7417276cc829 |
14 | 334961dbcd93 |
15 | 17b177bd72c8 |
hex | bed1dafeb65 |
13113033223013 has 2 divisors, whose sum is σ = 13113033223014. Its totient is φ = 13113033223012.
The previous prime is 13113033222959. The next prime is 13113033223019. The reversal of 13113033223013 is 31032233031131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12492393353764 + 620639869249 = 3534458^2 + 787807^2 .
It is a cyclic number.
It is not a de Polignac number, because 13113033223013 - 218 = 13113032960869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13113033223019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6556516611506 + 6556516611507.
It is an arithmetic number, because the mean of its divisors is an integer number (6556516611507).
Almost surely, 213113033223013 is an apocalyptic number.
It is an amenable number.
13113033223013 is a deficient number, since it is larger than the sum of its proper divisors (1).
13113033223013 is an equidigital number, since it uses as much as digits as its factorization.
13113033223013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 13113033223013 its reverse (31032233031131), we get a palindrome (44145266254144).
The spelling of 13113033223013 in words is "thirteen trillion, one hundred thirteen billion, thirty-three million, two hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •