Base | Representation |
---|---|
bin | 110110001100… |
… | …100101010001 |
3 | 222201210202210 |
4 | 312030211101 |
5 | 12114113223 |
6 | 1224302333 |
7 | 231521511 |
oct | 66144521 |
9 | 28653683 |
10 | 14207313 |
11 | 802418a |
12 | 49119a9 |
13 | 2c358c3 |
14 | 1c5b841 |
15 | 13a9893 |
hex | d8c951 |
14207313 has 8 divisors (see below), whose sum is σ = 19210176. Its totient is φ = 9338000.
The previous prime is 14207293. The next prime is 14207317. The reversal of 14207313 is 31370241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14207313 - 28 = 14207057 is a prime.
It is a super-3 number, since 3×142073133 (a number of 22 digits) contains 333 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 14207313.
It is not an unprimeable number, because it can be changed into a prime (14207317) 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, 33138 + ... + 33563.
It is an arithmetic number, because the mean of its divisors is an integer number (2401272).
Almost surely, 214207313 is an apocalyptic number.
It is an amenable number.
14207313 is a deficient number, since it is larger than the sum of its proper divisors (5002863).
14207313 is an equidigital number, since it uses as much as digits as its factorization.
14207313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66775.
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 14207313 is about 3769.2589457346. The cubic root of 14207313 is about 242.1980540638.
Adding to 14207313 its reverse (31370241), we get a palindrome (45577554).
The spelling of 14207313 in words is "fourteen million, two hundred seven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •