Base | Representation |
---|---|
bin | 110110010101… |
… | …110100000111 |
3 | 222210201122022 |
4 | 312111310013 |
5 | 12121321002 |
6 | 1225153355 |
7 | 232036661 |
oct | 66256407 |
9 | 28721568 |
10 | 14245127 |
11 | 804a636 |
12 | 492b85b |
13 | 2c49b90 |
14 | 1c6b531 |
15 | 13b5ba2 |
hex | d95d07 |
14245127 has 4 divisors (see below), whose sum is σ = 15340920. Its totient is φ = 13149336.
The previous prime is 14245109. The next prime is 14245157. The reversal of 14245127 is 72154241.
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 14245127 - 28 = 14244871 is a prime.
It is a super-2 number, since 2×142451272 = 405847286492258, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14245096 and 14245105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14245157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 547877 + ... + 547902.
It is an arithmetic number, because the mean of its divisors is an integer number (3835230).
Almost surely, 214245127 is an apocalyptic number.
14245127 is a deficient number, since it is larger than the sum of its proper divisors (1095793).
14245127 is a wasteful number, since it uses less digits than its factorization.
14245127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1095792.
The product of its digits is 2240, while the sum is 26.
The square root of 14245127 is about 3774.2717178285. The cubic root of 14245127 is about 242.4127407736.
Adding to 14245127 its reverse (72154241), we get a palindrome (86399368).
The spelling of 14245127 in words is "fourteen million, two hundred forty-five thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •