Base | Representation |
---|---|
bin | 1100110000001001110100… |
… | …1011101001110101101011 |
3 | 1211122102201012020111211012 |
4 | 3030002131023221311223 |
5 | 3314211322021111021 |
6 | 45453202540454135 |
7 | 2645004422231435 |
oct | 314023513516553 |
9 | 54572635214735 |
10 | 14021410332011 |
11 | 45164a065aa55 |
12 | 16a5539b4a34b |
13 | 7a92a0887064 |
14 | 3668d5b95655 |
15 | 194ae08a035b |
hex | cc09d2e9d6b |
14021410332011 has 2 divisors, whose sum is σ = 14021410332012. Its totient is φ = 14021410332010.
The previous prime is 14021410331987. The next prime is 14021410332077. The reversal of 14021410332011 is 11023301412041.
It is a weak prime.
It is an emirp because it is prime and its reverse (11023301412041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14021410332011 - 218 = 14021410069867 is a prime.
It is not a weakly prime, because it can be changed into another prime (14021410332311) 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, 7010705166005 + 7010705166006.
It is an arithmetic number, because the mean of its divisors is an integer number (7010705166006).
Almost surely, 214021410332011 is an apocalyptic number.
14021410332011 is a deficient number, since it is larger than the sum of its proper divisors (1).
14021410332011 is an equidigital number, since it uses as much as digits as its factorization.
14021410332011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 14021410332011 its reverse (11023301412041), we get a palindrome (25044711744052).
The spelling of 14021410332011 in words is "fourteen trillion, twenty-one billion, four hundred ten million, three hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •