Base | Representation |
---|---|
bin | 110101111010… |
… | …111111100011 |
3 | 222121010221102 |
4 | 311322333203 |
5 | 12104312032 |
6 | 1222545015 |
7 | 231101456 |
oct | 65727743 |
9 | 28533842 |
10 | 14135267 |
11 | 7a85043 |
12 | 489816b |
13 | 2c0bb83 |
14 | 1c3d49d |
15 | 1393362 |
hex | d7afe3 |
14135267 has 4 divisors (see below), whose sum is σ = 14622720. Its totient is φ = 13647816.
The previous prime is 14135263. The next prime is 14135269. The reversal of 14135267 is 76253141.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14135267 - 22 = 14135263 is a prime.
It is a super-2 number, since 2×141352672 = 399611546322578, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29), and also a Moran number because the ratio is a prime number: 487423 = 14135267 / (1 + 4 + 1 + 3 + 5 + 2 + 6 + 7).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14135263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 243683 + ... + 243740.
It is an arithmetic number, because the mean of its divisors is an integer number (3655680).
Almost surely, 214135267 is an apocalyptic number.
14135267 is a deficient number, since it is larger than the sum of its proper divisors (487453).
14135267 is an equidigital number, since it uses as much as digits as its factorization.
14135267 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 487452.
The product of its digits is 5040, while the sum is 29.
The square root of 14135267 is about 3759.6897478382. The cubic root of 14135267 is about 241.7879605676.
The spelling of 14135267 in words is "fourteen million, one hundred thirty-five thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •