Base | Representation |
---|---|
bin | 110101110000… |
… | …011101100011 |
3 | 222111221202210 |
4 | 311300131203 |
5 | 12101422011 |
6 | 1222013203 |
7 | 230531634 |
oct | 65603543 |
9 | 28457683 |
10 | 14092131 |
11 | 7a55699 |
12 | 4877203 |
13 | 2bc5351 |
14 | 1c2b88b |
15 | 13856a6 |
hex | d70763 |
14092131 has 4 divisors (see below), whose sum is σ = 18789512. Its totient is φ = 9394752.
The previous prime is 14092121. The next prime is 14092147. The reversal of 14092131 is 13129041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13129041 = 3 ⋅4376347.
It is not a de Polignac number, because 14092131 - 218 = 13829987 is a prime.
It is a super-3 number, since 3×140921313 (a number of 22 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14092098 and 14092107.
It is not an unprimeable number, because it can be changed into a prime (14092121) 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, 2348686 + ... + 2348691.
It is an arithmetic number, because the mean of its divisors is an integer number (4697378).
Almost surely, 214092131 is an apocalyptic number.
14092131 is a deficient number, since it is larger than the sum of its proper divisors (4697381).
14092131 is an equidigital number, since it uses as much as digits as its factorization.
14092131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4697380.
The product of its (nonzero) digits is 216, while the sum is 21.
The square root of 14092131 is about 3753.9487210136. The cubic root of 14092131 is about 241.5417585716.
The spelling of 14092131 in words is "fourteen million, ninety-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •