Base | Representation |
---|---|
bin | 110101101000… |
… | …011100001001 |
3 | 222110021200211 |
4 | 311220130021 |
5 | 12044344043 |
6 | 1221201121 |
7 | 230334064 |
oct | 65503411 |
9 | 28407624 |
10 | 14059273 |
11 | 7a32a38 |
12 | 48601a1 |
13 | 2bb33c7 |
14 | 1c1d8db |
15 | 137aa9d |
hex | d68709 |
14059273 has 4 divisors (see below), whose sum is σ = 14109588. Its totient is φ = 14008960.
The previous prime is 14059271. The next prime is 14059291. The reversal of 14059273 is 37295041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 37295041 = 7 ⋅5327863.
It can be written as a sum of positive squares in 2 ways, for example, as 4149369 + 9909904 = 2037^2 + 3148^2 .
It is a cyclic number.
It is not a de Polignac number, because 14059273 - 21 = 14059271 is a prime.
It is a Duffinian number.
14059273 is a modest number, since divided by 9273 gives 1405 as remainder.
It is not an unprimeable number, because it can be changed into a prime (14059271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24736 + ... + 25297.
It is an arithmetic number, because the mean of its divisors is an integer number (3527397).
Almost surely, 214059273 is an apocalyptic number.
It is an amenable number.
14059273 is a deficient number, since it is larger than the sum of its proper divisors (50315).
14059273 is an equidigital number, since it uses as much as digits as its factorization.
14059273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50314.
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 14059273 is about 3749.5697086466. The cubic root of 14059273 is about 241.3538817212.
The spelling of 14059273 in words is "fourteen million, fifty-nine thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •