Base | Representation |
---|---|
bin | 1100101101000111101100… |
… | …0011110011101101000001 |
3 | 1211110110012102011001220001 |
4 | 3023101323003303231001 |
5 | 3312333110322223434 |
6 | 45413223525520001 |
7 | 2641151142620101 |
oct | 313217303635501 |
9 | 54413172131801 |
10 | 13969298242369 |
11 | 44a6389751778 |
12 | 1697415873001 |
13 | 7a43b7385762 |
14 | 364190b4d201 |
15 | 1935908a6114 |
hex | cb47b0f3b41 |
13969298242369 has 2 divisors, whose sum is σ = 13969298242370. Its totient is φ = 13969298242368.
The previous prime is 13969298242349. The next prime is 13969298242387. The reversal of 13969298242369 is 96324289296931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8397314387344 + 5571983855025 = 2897812^2 + 2360505^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13969298242369 is a prime.
It is a super-2 number, since 2×139692982423692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13969298242309) 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, 6984649121184 + 6984649121185.
It is an arithmetic number, because the mean of its divisors is an integer number (6984649121185).
Almost surely, 213969298242369 is an apocalyptic number.
It is an amenable number.
13969298242369 is a deficient number, since it is larger than the sum of its proper divisors (1).
13969298242369 is an equidigital number, since it uses as much as digits as its factorization.
13969298242369 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 544195584, while the sum is 73.
The spelling of 13969298242369 in words is "thirteen trillion, nine hundred sixty-nine billion, two hundred ninety-eight million, two hundred forty-two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •