Base | Representation |
---|---|
bin | 110101010111… |
… | …011110000001 |
3 | 222022202100022 |
4 | 311113132001 |
5 | 12040133021 |
6 | 1215503225 |
7 | 226624322 |
oct | 65273601 |
9 | 28282308 |
10 | 13989761 |
11 | 7995795 |
12 | 4827b15 |
13 | 2b8a886 |
14 | 1c02449 |
15 | 13651ab |
hex | d57781 |
13989761 has 4 divisors (see below), whose sum is σ = 13997892. Its totient is φ = 13981632.
The previous prime is 13989709. The next prime is 13989763. The reversal of 13989761 is 16798931.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 16798931 = 31 ⋅541901.
It can be written as a sum of positive squares in 2 ways, for example, as 5550736 + 8439025 = 2356^2 + 2905^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13989761 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13989763) 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, 356 + ... + 5301.
It is an arithmetic number, because the mean of its divisors is an integer number (3499473).
Almost surely, 213989761 is an apocalyptic number.
It is an amenable number.
13989761 is a deficient number, since it is larger than the sum of its proper divisors (8131).
13989761 is an equidigital number, since it uses as much as digits as its factorization.
13989761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8130.
The product of its digits is 81648, while the sum is 44.
The square root of 13989761 is about 3740.2888925857. The cubic root of 13989761 is about 240.9554562625.
The spelling of 13989761 in words is "thirteen million, nine hundred eighty-nine thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •