Base | Representation |
---|---|
bin | 110101110100… |
… | …001110001011 |
3 | 222112201220011 |
4 | 311310032023 |
5 | 12102420111 |
6 | 1222212351 |
7 | 230624554 |
oct | 65641613 |
9 | 28481804 |
10 | 14107531 |
11 | 7a66219 |
12 | 48840b7 |
13 | 2bcc369 |
14 | 1c3332b |
15 | 138a021 |
hex | d7438b |
14107531 has 4 divisors (see below), whose sum is σ = 14338864. Its totient is φ = 13876200.
The previous prime is 14107529. The next prime is 14107537. The reversal of 14107531 is 13570141.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13570141 = 13 ⋅1043857.
It is a cyclic number.
It is not a de Polignac number, because 14107531 - 21 = 14107529 is a prime.
It is a super-2 number, since 2×141075312 = 398044861831922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14107537) 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, 115575 + ... + 115696.
It is an arithmetic number, because the mean of its divisors is an integer number (3584716).
Almost surely, 214107531 is an apocalyptic number.
14107531 is a deficient number, since it is larger than the sum of its proper divisors (231333).
14107531 is an equidigital number, since it uses as much as digits as its factorization.
14107531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231332.
The product of its (nonzero) digits is 420, while the sum is 22.
The square root of 14107531 is about 3755.9993343982. Note that the first 3 decimals coincide. The cubic root of 14107531 is about 241.6297128329.
Adding to 14107531 its reverse (13570141), we get a palindrome (27677672).
The spelling of 14107531 in words is "fourteen million, one hundred seven thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •