Base | Representation |
---|---|
bin | 110101100000… |
… | …100111000101 |
3 | 222101122201010 |
4 | 311200213011 |
5 | 12042332310 |
6 | 1220352433 |
7 | 230141433 |
oct | 65404705 |
9 | 28348633 |
10 | 14027205 |
11 | 7a10935 |
12 | 4845719 |
13 | 2ba192a |
14 | 1c11d53 |
15 | 1371320 |
hex | d609c5 |
14027205 has 8 divisors (see below), whose sum is σ = 22443552. Its totient is φ = 7481168.
The previous prime is 14027203. The next prime is 14027219. The reversal of 14027205 is 50272041.
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 14027205 - 21 = 14027203 is a prime.
It is a super-2 number, since 2×140272052 = 393524960224050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14027203) 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, 467559 + ... + 467588.
It is an arithmetic number, because the mean of its divisors is an integer number (2805444).
Almost surely, 214027205 is an apocalyptic number.
14027205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14027205 is a deficient number, since it is larger than the sum of its proper divisors (8416347).
14027205 is an equidigital number, since it uses as much as digits as its factorization.
14027205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 935155.
The product of its (nonzero) digits is 560, while the sum is 21.
The square root of 14027205 is about 3745.2910434304. The cubic root of 14027205 is about 241.1702395014.
Adding to 14027205 its reverse (50272041), we get a palindrome (64299246).
The spelling of 14027205 in words is "fourteen million, twenty-seven thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •