Base | Representation |
---|---|
bin | 110101101011… |
… | …000010110101 |
3 | 222110211022221 |
4 | 311223002311 |
5 | 12100214231 |
6 | 1221322341 |
7 | 230410144 |
oct | 65530265 |
9 | 28424287 |
10 | 14069941 |
11 | 7a3aa56 |
12 | 48663b1 |
13 | 2bb8212 |
14 | 1c2375b |
15 | 137dd11 |
hex | d6b0b5 |
14069941 has 2 divisors, whose sum is σ = 14069942. Its totient is φ = 14069940.
The previous prime is 14069927. The next prime is 14069977. The reversal of 14069941 is 14996041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13950225 + 119716 = 3735^2 + 346^2 .
It is an emirp because it is prime and its reverse (14996041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14069941 - 215 = 14037173 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14069897 and 14069906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14069981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7034970 + 7034971.
It is an arithmetic number, because the mean of its divisors is an integer number (7034971).
Almost surely, 214069941 is an apocalyptic number.
It is an amenable number.
14069941 is a deficient number, since it is larger than the sum of its proper divisors (1).
14069941 is an equidigital number, since it uses as much as digits as its factorization.
14069941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 34.
The square root of 14069941 is about 3750.9920021242. The cubic root of 14069941 is about 241.4149117202.
The spelling of 14069941 in words is "fourteen million, sixty-nine thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •