Base | Representation |
---|---|
bin | 1100110101010101000001… |
… | …1101101010011000100101 |
3 | 1211221221012021210122021012 |
4 | 3031111100131222120211 |
5 | 3322140412241123141 |
6 | 50002105042232005 |
7 | 2654302551661403 |
oct | 315252035523045 |
9 | 54857167718235 |
10 | 14110317520421 |
11 | 4550174426571 |
12 | 16ba810955605 |
13 | 7b479c174555 |
14 | 36ad2b8a6473 |
15 | 197095d15ceb |
hex | cd55076a625 |
14110317520421 has 2 divisors, whose sum is σ = 14110317520422. Its totient is φ = 14110317520420.
The previous prime is 14110317520391. The next prime is 14110317520423. The reversal of 14110317520421 is 12402571301141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7598705730625 + 6511611789796 = 2756575^2 + 2551786^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14110317520421 is a prime.
Together with 14110317520423, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14110317520423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7055158760210 + 7055158760211.
It is an arithmetic number, because the mean of its divisors is an integer number (7055158760211).
Almost surely, 214110317520421 is an apocalyptic number.
It is an amenable number.
14110317520421 is a deficient number, since it is larger than the sum of its proper divisors (1).
14110317520421 is an equidigital number, since it uses as much as digits as its factorization.
14110317520421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6720, while the sum is 32.
Adding to 14110317520421 its reverse (12402571301141), we get a palindrome (26512888821562).
The spelling of 14110317520421 in words is "fourteen trillion, one hundred ten billion, three hundred seventeen million, five hundred twenty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •