Base | Representation |
---|---|
bin | 110110011011… |
… | …101110011001 |
3 | 222211221211222 |
4 | 312123232121 |
5 | 12123104322 |
6 | 1225501425 |
7 | 232200365 |
oct | 66335631 |
9 | 28757758 |
10 | 14269337 |
11 | 8066845 |
12 | 4941875 |
13 | 2c57bc4 |
14 | 1c762a5 |
15 | 13bce42 |
hex | d9bb99 |
14269337 has 2 divisors, whose sum is σ = 14269338. Its totient is φ = 14269336.
The previous prime is 14269291. The next prime is 14269373. The reversal of 14269337 is 73396241.
Together with next prime (14269373) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13756681 + 512656 = 3709^2 + 716^2 .
It is a cyclic number.
It is not a de Polignac number, because 14269337 - 216 = 14203801 is a prime.
It is a super-2 number, since 2×142693372 = 407227956839138, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14269297 and 14269306.
It is not a weakly prime, because it can be changed into another prime (14269397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7134668 + 7134669.
It is an arithmetic number, because the mean of its divisors is an integer number (7134669).
Almost surely, 214269337 is an apocalyptic number.
It is an amenable number.
14269337 is a deficient number, since it is larger than the sum of its proper divisors (1).
14269337 is an equidigital number, since it uses as much as digits as its factorization.
14269337 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 27216, while the sum is 35.
The square root of 14269337 is about 3777.4775975510. The cubic root of 14269337 is about 242.5499921731.
The spelling of 14269337 in words is "fourteen million, two hundred sixty-nine thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •