Base | Representation |
---|---|
bin | 110100111110… |
… | …100111110001 |
3 | 222010120201211 |
4 | 310332213301 |
5 | 12023403420 |
6 | 1213400121 |
7 | 226021516 |
oct | 64764761 |
9 | 28116654 |
10 | 13887985 |
11 | 7926281 |
12 | 4799041 |
13 | 2b53457 |
14 | 1bb730d |
15 | 1344e5a |
hex | d3e9f1 |
13887985 has 4 divisors (see below), whose sum is σ = 16665588. Its totient is φ = 11110384.
The previous prime is 13887977. The next prime is 13887989. The reversal of 13887985 is 58978831.
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 2334784 + 11553201 = 1528^2 + 3399^2 .
It is a cyclic number.
It is not a de Polignac number, because 13887985 - 23 = 13887977 is a prime.
It is a super-2 number, since 2×138879852 = 385752254720450, which contains 22 as substring.
It is a Smith number, since the sum of its digits (49) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13887989) 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, 1388794 + ... + 1388803.
It is an arithmetic number, because the mean of its divisors is an integer number (4166397).
Almost surely, 213887985 is an apocalyptic number.
It is an amenable number.
13887985 is a deficient number, since it is larger than the sum of its proper divisors (2777603).
13887985 is an equidigital number, since it uses as much as digits as its factorization.
13887985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2777602.
The product of its digits is 483840, while the sum is 49.
The square root of 13887985 is about 3726.6586911066. The cubic root of 13887985 is about 240.3697137380.
The spelling of 13887985 in words is "thirteen million, eight hundred eighty-seven thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •