Base | Representation |
---|---|
bin | 1100100101000101101001… |
… | …0001011111111010101001 |
3 | 1210222021000201110221012111 |
4 | 3021101122101133322221 |
5 | 3303103010130322422 |
6 | 45230003222242321 |
7 | 2625164510433526 |
oct | 311213221377251 |
9 | 53867021427174 |
10 | 13831309229737 |
11 | 445290952a16a |
12 | 16747255863a1 |
13 | 794396316c1c |
14 | 35b62063a14d |
15 | 18ebb64b7a77 |
hex | c945a45fea9 |
13831309229737 has 2 divisors, whose sum is σ = 13831309229738. Its totient is φ = 13831309229736.
The previous prime is 13831309229729. The next prime is 13831309229761. The reversal of 13831309229737 is 73792290313831.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13824743530896 + 6565698841 = 3718164^2 + 81029^2 .
It is a cyclic number.
It is not a de Polignac number, because 13831309229737 - 23 = 13831309229729 is a prime.
It is a super-4 number, since 4×138313092297374 (a number of 54 digits) contains 4444 as substring.
It is not a weakly prime, because it can be changed into another prime (13831309224737) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6915654614868 + 6915654614869.
It is an arithmetic number, because the mean of its divisors is an integer number (6915654614869).
Almost surely, 213831309229737 is an apocalyptic number.
It is an amenable number.
13831309229737 is a deficient number, since it is larger than the sum of its proper divisors (1).
13831309229737 is an equidigital number, since it uses as much as digits as its factorization.
13831309229737 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10287648, while the sum is 58.
The spelling of 13831309229737 in words is "thirteen trillion, eight hundred thirty-one billion, three hundred nine million, two hundred twenty-nine thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •