Base | Representation |
---|---|
bin | 1100110111011100101100… |
… | …0001001111101001100101 |
3 | 1212002102012011201100012112 |
4 | 3031313023001033221211 |
5 | 3323240002223004241 |
6 | 50030530345130405 |
7 | 2660032145624411 |
oct | 315671301175145 |
9 | 55072164640175 |
10 | 14146733406821 |
11 | 4564661226a54 |
12 | 1705894489a05 |
13 | 7b8053819922 |
14 | 36c9c405bd41 |
15 | 197ec7d281eb |
hex | cddcb04fa65 |
14146733406821 has 2 divisors, whose sum is σ = 14146733406822. Its totient is φ = 14146733406820.
The previous prime is 14146733406811. The next prime is 14146733406823. The reversal of 14146733406821 is 12860433764141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13609717048225 + 537016358596 = 3689135^2 + 732814^2 .
It is a cyclic number.
It is not a de Polignac number, because 14146733406821 - 210 = 14146733405797 is a prime.
Together with 14146733406823, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14146733406821.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14146733406823) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7073366703410 + 7073366703411.
It is an arithmetic number, because the mean of its divisors is an integer number (7073366703411).
Almost surely, 214146733406821 is an apocalyptic number.
It is an amenable number.
14146733406821 is a deficient number, since it is larger than the sum of its proper divisors (1).
14146733406821 is an equidigital number, since it uses as much as digits as its factorization.
14146733406821 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2322432, while the sum is 50.
The spelling of 14146733406821 in words is "fourteen trillion, one hundred forty-six billion, seven hundred thirty-three million, four hundred six thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •