Base | Representation |
---|---|
bin | 1100111010110010110001… |
… | …0111001100000111011001 |
3 | 1212021220112012100212101201 |
4 | 3032230230113030013121 |
5 | 3330210200441434223 |
6 | 50113153033514201 |
7 | 2664135226310314 |
oct | 316545427140731 |
9 | 55256465325351 |
10 | 14204201124313 |
11 | 4586a71260752 |
12 | 1714a52272961 |
13 | 7c05b17537a5 |
14 | 3716b649997b |
15 | 19973d0c4ead |
hex | ceb2c5cc1d9 |
14204201124313 has 2 divisors, whose sum is σ = 14204201124314. Its totient is φ = 14204201124312.
The previous prime is 14204201124247. The next prime is 14204201124317. The reversal of 14204201124313 is 31342110240241.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11492425442304 + 2711775682009 = 3390048^2 + 1646747^2 .
It is a cyclic number.
It is not a de Polignac number, because 14204201124313 - 213 = 14204201116121 is a prime.
It is not a weakly prime, because it can be changed into another prime (14204201124317) 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, 7102100562156 + 7102100562157.
It is an arithmetic number, because the mean of its divisors is an integer number (7102100562157).
Almost surely, 214204201124313 is an apocalyptic number.
It is an amenable number.
14204201124313 is a deficient number, since it is larger than the sum of its proper divisors (1).
14204201124313 is an equidigital number, since it uses as much as digits as its factorization.
14204201124313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 14204201124313 its reverse (31342110240241), we get a palindrome (45546311364554).
The spelling of 14204201124313 in words is "fourteen trillion, two hundred four billion, two hundred one million, one hundred twenty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •