Base | Representation |
---|---|
bin | 110101101000… |
… | …000000011111 |
3 | 222110012021021 |
4 | 311220000133 |
5 | 12044320003 |
6 | 1221145011 |
7 | 230325655 |
oct | 65500037 |
9 | 28405237 |
10 | 14057503 |
11 | 7a31679 |
12 | 485b167 |
13 | 2bb2665 |
14 | 1c1cdd5 |
15 | 137a2bd |
hex | d6801f |
14057503 has 8 divisors (see below), whose sum is σ = 14376960. Its totient is φ = 13741560.
The previous prime is 14057501. The next prime is 14057507. The reversal of 14057503 is 30575041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14057503 - 21 = 14057501 is a prime.
It is a super-3 number, since 3×140575033 (a number of 22 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14057501) 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 7 ways as a sum of consecutive naturals, for example, 8238 + ... + 9796.
It is an arithmetic number, because the mean of its divisors is an integer number (1797120).
Almost surely, 214057503 is an apocalyptic number.
14057503 is a deficient number, since it is larger than the sum of its proper divisors (319457).
14057503 is a wasteful number, since it uses less digits than its factorization.
14057503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1757.
The product of its (nonzero) digits is 2100, while the sum is 25.
The square root of 14057503 is about 3749.3336741346. Note that the first 3 decimals coincide. The cubic root of 14057503 is about 241.3437528357.
It can be divided in two parts, 1 and 4057503, that added together give a palindrome (4057504).
The spelling of 14057503 in words is "fourteen million, fifty-seven thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •