Base | Representation |
---|---|
bin | 110111001100… |
… | …111110001101 |
3 | 1000020012112221 |
4 | 313030332031 |
5 | 12201033203 |
6 | 1234055341 |
7 | 234000442 |
oct | 67147615 |
9 | 30205487 |
10 | 14471053 |
11 | 8194353 |
12 | 4a1a551 |
13 | 2cc896c |
14 | 1cc99c9 |
15 | 140cabd |
hex | dccf8d |
14471053 has 4 divisors (see below), whose sum is σ = 14485660. Its totient is φ = 14456448.
The previous prime is 14471021. The next prime is 14471057. The reversal of 14471053 is 35017441.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11309769 + 3161284 = 3363^2 + 1778^2 .
It is a cyclic number.
It is not a de Polignac number, because 14471053 - 25 = 14471021 is a prime.
It is a super-2 number, since 2×144710532 = 418822749857618, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14471057) 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, 5700 + ... + 7837.
It is an arithmetic number, because the mean of its divisors is an integer number (3621415).
Almost surely, 214471053 is an apocalyptic number.
It is an amenable number.
14471053 is a deficient number, since it is larger than the sum of its proper divisors (14607).
14471053 is a wasteful number, since it uses less digits than its factorization.
14471053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14606.
The product of its (nonzero) digits is 1680, while the sum is 25.
The square root of 14471053 is about 3804.0837267337. The cubic root of 14471053 is about 243.6875704243.
Adding to 14471053 its reverse (35017441), we get a palindrome (49488494).
It can be divided in two parts, 1447 and 1053, that added together give a square (2500 = 502).
The spelling of 14471053 in words is "fourteen million, four hundred seventy-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •