Base | Representation |
---|---|
bin | 1100110111001111010110… |
… | …0011101001001010101101 |
3 | 1212002001221120212002211122 |
4 | 3031303311203221022231 |
5 | 3323210133414200023 |
6 | 50025135133230325 |
7 | 2656544331206606 |
oct | 315636543511255 |
9 | 55061846762748 |
10 | 14143152100013 |
11 | 4563093716162 |
12 | 17050550323a5 |
13 | 7b7902883181 |
14 | 36c764576dad |
15 | 197d6870a2c8 |
hex | cdcf58e92ad |
14143152100013 has 2 divisors, whose sum is σ = 14143152100014. Its totient is φ = 14143152100012.
The previous prime is 14143152100003. The next prime is 14143152100031. The reversal of 14143152100013 is 31000125134141.
Together with next prime (14143152100031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13157029616644 + 986122483369 = 3627262^2 + 993037^2 .
It is a cyclic number.
It is not a de Polignac number, because 14143152100013 - 26 = 14143152099949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14143152100003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7071576050006 + 7071576050007.
It is an arithmetic number, because the mean of its divisors is an integer number (7071576050007).
Almost surely, 214143152100013 is an apocalyptic number.
It is an amenable number.
14143152100013 is a deficient number, since it is larger than the sum of its proper divisors (1).
14143152100013 is an equidigital number, since it uses as much as digits as its factorization.
14143152100013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 14143152100013 its reverse (31000125134141), we get a palindrome (45143277234154).
The spelling of 14143152100013 in words is "fourteen trillion, one hundred forty-three billion, one hundred fifty-two million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •