Base | Representation |
---|---|
bin | 110100111010… |
… | …111001001001 |
3 | 222002210210012 |
4 | 310322321021 |
5 | 12022411323 |
6 | 1213201305 |
7 | 225626141 |
oct | 64727111 |
9 | 28083705 |
10 | 13872713 |
11 | 7915858 |
12 | 4790235 |
13 | 2b4950a |
14 | 1bb1921 |
15 | 1340678 |
hex | d3ae49 |
13872713 has 4 divisors (see below), whose sum is σ = 13913040. Its totient is φ = 13832388.
The previous prime is 13872707. The next prime is 13872737. The reversal of 13872713 is 31727831.
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: 31727831 = 17 ⋅1866343.
It is a cyclic number.
It is not a de Polignac number, because 13872713 - 28 = 13872457 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13872713.
It is not an unprimeable number, because it can be changed into a prime (13872763) 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, 19643 + ... + 20336.
It is an arithmetic number, because the mean of its divisors is an integer number (3478260).
Almost surely, 213872713 is an apocalyptic number.
It is an amenable number.
13872713 is a deficient number, since it is larger than the sum of its proper divisors (40327).
13872713 is an equidigital number, since it uses as much as digits as its factorization.
13872713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40326.
The product of its digits is 7056, while the sum is 32.
The square root of 13872713 is about 3724.6091070071. The cubic root of 13872713 is about 240.2815734576.
The spelling of 13872713 in words is "thirteen million, eight hundred seventy-two thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •