Base | Representation |
---|---|
bin | 110110111000… |
… | …111101000001 |
3 | 1000002001002001 |
4 | 312320331001 |
5 | 12140422212 |
6 | 1232224001 |
7 | 233206414 |
oct | 66707501 |
9 | 30061061 |
10 | 14389057 |
11 | 8138791 |
12 | 499b001 |
13 | 2c9a547 |
14 | 1ca7b7b |
15 | 13e3657 |
hex | db8f41 |
14389057 has 4 divisors (see below), whose sum is σ = 14412996. Its totient is φ = 14365120.
The previous prime is 14389051. The next prime is 14389087. The reversal of 14389057 is 75098341.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 75098341 = 239 ⋅314219.
It can be written as a sum of positive squares in 2 ways, for example, as 2835856 + 11553201 = 1684^2 + 3399^2 .
It is a cyclic number.
It is not a de Polignac number, because 14389057 - 219 = 13864769 is a prime.
It is a super-2 number, since 2×143890572 = 414089922698498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14389051) 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, 11044 + ... + 12277.
It is an arithmetic number, because the mean of its divisors is an integer number (3603249).
Almost surely, 214389057 is an apocalyptic number.
It is an amenable number.
14389057 is a deficient number, since it is larger than the sum of its proper divisors (23939).
14389057 is an equidigital number, since it uses as much as digits as its factorization.
14389057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23938.
The product of its (nonzero) digits is 30240, while the sum is 37.
The square root of 14389057 is about 3793.2910513168. The cubic root of 14389057 is about 243.2264368570.
The spelling of 14389057 in words is "fourteen million, three hundred eighty-nine thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •