Base | Representation |
---|---|
bin | 110110100111… |
… | …010111100011 |
3 | 222221101021021 |
4 | 312213113203 |
5 | 12131121102 |
6 | 1230510311 |
7 | 232456414 |
oct | 66472743 |
9 | 28841237 |
10 | 14317027 |
11 | 809965a |
12 | 4965397 |
13 | 2c7381a |
14 | 1c8980b |
15 | 13cc137 |
hex | da75e3 |
14317027 has 4 divisors (see below), whose sum is σ = 14358400. Its totient is φ = 14275656.
The previous prime is 14317021. The next prime is 14317031. The reversal of 14317027 is 72071341.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 72071341 = 4051 ⋅17791.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14317027 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14316992 and 14317010.
It is not an unprimeable number, because it can be changed into a prime (14317021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20163 + ... + 20860.
It is an arithmetic number, because the mean of its divisors is an integer number (3589600).
Almost surely, 214317027 is an apocalyptic number.
14317027 is a deficient number, since it is larger than the sum of its proper divisors (41373).
14317027 is an equidigital number, since it uses as much as digits as its factorization.
14317027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41372.
The product of its (nonzero) digits is 1176, while the sum is 25.
The square root of 14317027 is about 3783.7847454632. The cubic root of 14317027 is about 242.8199030228.
Adding to 14317027 its reverse (72071341), we get a palindrome (86388368).
It can be divided in two parts, 143170 and 27, that multiplied together give a triangular number (3865590 = T2780).
The spelling of 14317027 in words is "fourteen million, three hundred seventeen thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •