Base | Representation |
---|---|
bin | 1100110001011011011010… |
… | …1100100011010110001101 |
3 | 1211201112020122101122211221 |
4 | 3030112312230203112031 |
5 | 3320041201141114203 |
6 | 45511224203443341 |
7 | 2646411251565562 |
oct | 314266654432615 |
9 | 54645218348757 |
10 | 14043313223053 |
11 | 452481022a1a4 |
12 | 16a9831226551 |
13 | 7ab38156840a |
14 | 3679b2a98869 |
15 | 1954736eaabd |
hex | cc5b6b2358d |
14043313223053 has 2 divisors, whose sum is σ = 14043313223054. Its totient is φ = 14043313223052.
The previous prime is 14043313222997. The next prime is 14043313223057. The reversal of 14043313223053 is 35032231334041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11914626387049 + 2128686836004 = 3451757^2 + 1459002^2 .
It is a cyclic number.
It is not a de Polignac number, because 14043313223053 - 29 = 14043313222541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14043313223057) 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, 7021656611526 + 7021656611527.
It is an arithmetic number, because the mean of its divisors is an integer number (7021656611527).
Almost surely, 214043313223053 is an apocalyptic number.
It is an amenable number.
14043313223053 is a deficient number, since it is larger than the sum of its proper divisors (1).
14043313223053 is an equidigital number, since it uses as much as digits as its factorization.
14043313223053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 77760, while the sum is 34.
Adding to 14043313223053 its reverse (35032231334041), we get a palindrome (49075544557094).
The spelling of 14043313223053 in words is "fourteen trillion, forty-three billion, three hundred thirteen million, two hundred twenty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •