Base | Representation |
---|---|
bin | 110110011011… |
… | …111110000101 |
3 | 222212000020011 |
4 | 312123332011 |
5 | 12123122331 |
6 | 1225510221 |
7 | 232203331 |
oct | 66337605 |
9 | 28760204 |
10 | 14270341 |
11 | 8067578 |
12 | 4942371 |
13 | 2c584b7 |
14 | 1c767c1 |
15 | 13bd3b1 |
hex | d9bf85 |
14270341 has 4 divisors (see below), whose sum is σ = 14408992. Its totient is φ = 14131692.
The previous prime is 14270339. The next prime is 14270351. The reversal of 14270341 is 14307241.
14270341 is nontrivially palindromic in base 14.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 14307241 = 13 ⋅1100557.
It is a cyclic number.
It is not a de Polignac number, because 14270341 - 21 = 14270339 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 (14270351) 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, 69171 + ... + 69376.
It is an arithmetic number, because the mean of its divisors is an integer number (3602248).
Almost surely, 214270341 is an apocalyptic number.
It is an amenable number.
14270341 is a deficient number, since it is larger than the sum of its proper divisors (138651).
14270341 is a wasteful number, since it uses less digits than its factorization.
14270341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138650.
The product of its (nonzero) digits is 672, while the sum is 22.
The square root of 14270341 is about 3777.6104881261. The cubic root of 14270341 is about 242.5556806991. Note that the first 3 decimals are identical.
Adding to 14270341 its reverse (14307241), we get a palindrome (28577582).
The spelling of 14270341 in words is "fourteen million, two hundred seventy thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •