Base | Representation |
---|---|
bin | 1011111011110111101111… |
… | …1100000011110111010001 |
3 | 1201110120021200101010011011 |
4 | 2332331323330003313101 |
5 | 3210002310313300223 |
6 | 43524414503050521 |
7 | 2523056145111214 |
oct | 276757374036721 |
9 | 51416250333134 |
10 | 13123204431313 |
11 | 41aa579864559 |
12 | 157b446740a41 |
13 | 742688a03292 |
14 | 335248b8b77b |
15 | 17b570b1380d |
hex | bef7bf03dd1 |
13123204431313 has 2 divisors, whose sum is σ = 13123204431314. Its totient is φ = 13123204431312.
The previous prime is 13123204431223. The next prime is 13123204431371. The reversal of 13123204431313 is 31313440232131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13075253504784 + 47950926529 = 3615972^2 + 218977^2 .
It is a cyclic number.
It is not a de Polignac number, because 13123204431313 - 233 = 13114614496721 is a prime.
It is not a weakly prime, because it can be changed into another prime (13123204431013) 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, 6561602215656 + 6561602215657.
It is an arithmetic number, because the mean of its divisors is an integer number (6561602215657).
Almost surely, 213123204431313 is an apocalyptic number.
It is an amenable number.
13123204431313 is a deficient number, since it is larger than the sum of its proper divisors (1).
13123204431313 is an equidigital number, since it uses as much as digits as its factorization.
13123204431313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 31.
Adding to 13123204431313 its reverse (31313440232131), we get a palindrome (44436644663444).
The spelling of 13123204431313 in words is "thirteen trillion, one hundred twenty-three billion, two hundred four million, four hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •