Base | Representation |
---|---|
bin | 110110001100… |
… | …000101010011 |
3 | 222201200222000 |
4 | 312030011103 |
5 | 12114032032 |
6 | 1224245043 |
7 | 231512526 |
oct | 66140523 |
9 | 28650860 |
10 | 14205267 |
11 | 802269a |
12 | 4910783 |
13 | 2c349ab |
14 | 1c5abbd |
15 | 13a8e7c |
hex | d8c153 |
14205267 has 8 divisors (see below), whose sum is σ = 21044880. Its totient is φ = 9470160.
The previous prime is 14205259. The next prime is 14205281. The reversal of 14205267 is 76250241.
It is not a de Polignac number, because 14205267 - 23 = 14205259 is a prime.
It is a super-2 number, since 2×142052672 = 403579221082578, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 526121 = 14205267 / (1 + 4 + 2 + 0 + 5 + 2 + 6 + 7).
It is a self number, because there is not a number n which added to its sum of digits gives 14205267.
It is not an unprimeable number, because it can be changed into a prime (14205067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 263034 + ... + 263087.
It is an arithmetic number, because the mean of its divisors is an integer number (2630610).
Almost surely, 214205267 is an apocalyptic number.
14205267 is a deficient number, since it is larger than the sum of its proper divisors (6839613).
14205267 is an equidigital number, since it uses as much as digits as its factorization.
14205267 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 526130 (or 526124 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The square root of 14205267 is about 3768.9875298281. The cubic root of 14205267 is about 242.1864271642.
The spelling of 14205267 in words is "fourteen million, two hundred five thousand, two hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •