Base | Representation |
---|---|
bin | 1101000111010111000110… |
… | …0110011001000111001101 |
3 | 1220001112211100002011212021 |
4 | 3101311301212121013031 |
5 | 3342224341420234123 |
6 | 50400301350010141 |
7 | 3015550536661162 |
oct | 321656146310715 |
9 | 56045740064767 |
10 | 14420111102413 |
11 | 465a597870985 |
12 | 174a86a046951 |
13 | 807a6cc99c93 |
14 | 37bd19598069 |
15 | 1a01781abc5d |
hex | d1d719991cd |
14420111102413 has 2 divisors, whose sum is σ = 14420111102414. Its totient is φ = 14420111102412.
The previous prime is 14420111102407. The next prime is 14420111102459. The reversal of 14420111102413 is 31420111102441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13075434304009 + 1344676798404 = 3615997^2 + 1159602^2 .
It is a cyclic number.
It is not a de Polignac number, because 14420111102413 - 221 = 14420109005261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14420111102513) 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, 7210055551206 + 7210055551207.
It is an arithmetic number, because the mean of its divisors is an integer number (7210055551207).
Almost surely, 214420111102413 is an apocalyptic number.
It is an amenable number.
14420111102413 is a deficient number, since it is larger than the sum of its proper divisors (1).
14420111102413 is an equidigital number, since it uses as much as digits as its factorization.
14420111102413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 14420111102413 its reverse (31420111102441), we get a palindrome (45840222204854).
The spelling of 14420111102413 in words is "fourteen trillion, four hundred twenty billion, one hundred eleven million, one hundred two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •