Base | Representation |
---|---|
bin | 110101110101… |
… | …001000011101 |
3 | 222112221000022 |
4 | 311311020131 |
5 | 12103030021 |
6 | 1222241525 |
7 | 230641463 |
oct | 65651035 |
9 | 28487008 |
10 | 14111261 |
11 | 7a68aaa |
12 | 48862a5 |
13 | 2c00c78 |
14 | 1c34833 |
15 | 138b1ab |
hex | d7521d |
14111261 has 4 divisors (see below), whose sum is σ = 14120124. Its totient is φ = 14102400.
The previous prime is 14111239. The next prime is 14111263. The reversal of 14111261 is 16211141.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 16211141 = 509 ⋅31849.
It can be written as a sum of positive squares in 2 ways, for example, as 5736025 + 8375236 = 2395^2 + 2894^2 .
It is a cyclic number.
It is not a de Polignac number, because 14111261 - 210 = 14110237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14111263) 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, 1310 + ... + 5471.
It is an arithmetic number, because the mean of its divisors is an integer number (3530031).
Almost surely, 214111261 is an apocalyptic number.
It is an amenable number.
14111261 is a deficient number, since it is larger than the sum of its proper divisors (8863).
14111261 is an equidigital number, since it uses as much as digits as its factorization.
14111261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8862.
The product of its digits is 48, while the sum is 17.
The square root of 14111261 is about 3756.4958405408. The cubic root of 14111261 is about 241.6510064102.
The spelling of 14111261 in words is "fourteen million, one hundred eleven thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •