Base | Representation |
---|---|
bin | 110101011100… |
… | …101001001101 |
3 | 222100211102100 |
4 | 311130221031 |
5 | 12041322312 |
6 | 1220145313 |
7 | 230043162 |
oct | 65345115 |
9 | 28324370 |
10 | 14010957 |
11 | 79aa704 |
12 | 4838239 |
13 | 2b9740c |
14 | 1c0a069 |
15 | 136b5dc |
hex | d5ca4d |
14010957 has 6 divisors (see below), whose sum is σ = 20238062. Its totient is φ = 9340632.
The previous prime is 14010947. The next prime is 14011001. The reversal of 14010957 is 75901041.
14010957 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 13995081 + 15876 = 3741^2 + 126^2 .
It is not a de Polignac number, because 14010957 - 214 = 13994573 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14010957.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14010947) 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 5 ways as a sum of consecutive naturals, for example, 778378 + ... + 778395.
Almost surely, 214010957 is an apocalyptic number.
It is an amenable number.
14010957 is a deficient number, since it is larger than the sum of its proper divisors (6227105).
14010957 is a wasteful number, since it uses less digits than its factorization.
14010957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1556779 (or 1556776 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 14010957 is about 3743.1212911152. The cubic root of 14010957 is about 241.0770860424.
Adding to 14010957 its reverse (75901041), we get a palindrome (89911998).
The spelling of 14010957 in words is "fourteen million, ten thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •