Base | Representation |
---|---|
bin | 1011111011111000100111… |
… | …1111100100011110011101 |
3 | 1201110120220010002001100212 |
4 | 2332332021333210132131 |
5 | 3210003301144413344 |
6 | 43524454125102205 |
7 | 2523065040304616 |
oct | 276761177443635 |
9 | 51416803061325 |
10 | 13123440232349 |
11 | 41aa68a97a347 |
12 | 157b4b16b7965 |
13 | 7426c5813b15 |
14 | 33526c20cc0d |
15 | 17b58669079e |
hex | bef89fe479d |
13123440232349 has 2 divisors, whose sum is σ = 13123440232350. Its totient is φ = 13123440232348.
The previous prime is 13123440232303. The next prime is 13123440232363. The reversal of 13123440232349 is 94323204432131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9514029208324 + 3609411024025 = 3084482^2 + 1899845^2 .
It is a cyclic number.
It is not a de Polignac number, because 13123440232349 - 216 = 13123440166813 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 (13123440232379) 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, 6561720116174 + 6561720116175.
It is an arithmetic number, because the mean of its divisors is an integer number (6561720116175).
Almost surely, 213123440232349 is an apocalyptic number.
It is an amenable number.
13123440232349 is a deficient number, since it is larger than the sum of its proper divisors (1).
13123440232349 is an equidigital number, since it uses as much as digits as its factorization.
13123440232349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 373248, while the sum is 41.
The spelling of 13123440232349 in words is "thirteen trillion, one hundred twenty-three billion, four hundred forty million, two hundred thirty-two thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •