Base | Representation |
---|---|
bin | 110101000101… |
… | …101000101001 |
3 | 222012001010211 |
4 | 311011220221 |
5 | 12030313323 |
6 | 1214141121 |
7 | 226201336 |
oct | 65055051 |
9 | 28161124 |
10 | 13916713 |
11 | 7945918 |
12 | 47b17a1 |
13 | 2b63555 |
14 | 1bc398d |
15 | 134d70d |
hex | d45a29 |
13916713 has 4 divisors (see below), whose sum is σ = 13994640. Its totient is φ = 13838788.
The previous prime is 13916711. The next prime is 13916729. The reversal of 13916713 is 31761931.
13916713 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31761931 = 29 ⋅1095239.
It is a cyclic number.
It is not a de Polignac number, because 13916713 - 21 = 13916711 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13916711) 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 3 ways as a sum of consecutive naturals, for example, 38695 + ... + 39052.
It is an arithmetic number, because the mean of its divisors is an integer number (3498660).
Almost surely, 213916713 is an apocalyptic number.
It is an amenable number.
13916713 is a deficient number, since it is larger than the sum of its proper divisors (77927).
13916713 is an equidigital number, since it uses as much as digits as its factorization.
13916713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77926.
The product of its digits is 3402, while the sum is 31.
The square root of 13916713 is about 3730.5110909901. The cubic root of 13916713 is about 240.5353385629.
The spelling of 13916713 in words is "thirteen million, nine hundred sixteen thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •