Base | Representation |
---|---|
bin | 1100110110101010010100… |
… | …0101101000100011011111 |
3 | 1212001010021212000212110022 |
4 | 3031222211011220203133 |
5 | 3323024304300340221 |
6 | 50020412533102355 |
7 | 2656043112611063 |
oct | 315524505504337 |
9 | 55033255025408 |
10 | 14133212121311 |
11 | 4559952877028 |
12 | 17031401879bb |
13 | 7b69aa44c57a |
14 | 36c0a0399aa3 |
15 | 197985c564ab |
hex | cdaa51688df |
14133212121311 has 2 divisors, whose sum is σ = 14133212121312. Its totient is φ = 14133212121310.
The previous prime is 14133212121253. The next prime is 14133212121341. The reversal of 14133212121311 is 11312121233141.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14133212121311 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14133212121341) 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, 7066606060655 + 7066606060656.
It is an arithmetic number, because the mean of its divisors is an integer number (7066606060656).
Almost surely, 214133212121311 is an apocalyptic number.
14133212121311 is a deficient number, since it is larger than the sum of its proper divisors (1).
14133212121311 is an equidigital number, since it uses as much as digits as its factorization.
14133212121311 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 864, while the sum is 26.
Adding to 14133212121311 its reverse (11312121233141), we get a palindrome (25445333354452).
The spelling of 14133212121311 in words is "fourteen trillion, one hundred thirty-three billion, two hundred twelve million, one hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •