Base | Representation |
---|---|
bin | 11001111101110000… |
… | …01010001110111001 |
3 | 1022222111012210010211 |
4 | 30332320022032321 |
5 | 212022042430012 |
6 | 10223122311121 |
7 | 1002304304101 |
oct | 147670121671 |
9 | 38874183124 |
10 | 13939811257 |
11 | 5a03729579 |
12 | 28504b84a1 |
13 | 1411cc7038 |
14 | 9634ca201 |
15 | 568be46a7 |
hex | 33ee0a3b9 |
13939811257 has 4 divisors (see below), whose sum is σ = 13940726500. Its totient is φ = 13938896016.
The previous prime is 13939811201. The next prime is 13939811267. The reversal of 13939811257 is 75211893931.
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 7270802361 + 6669008896 = 85269^2 + 81664^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13939811257 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 13939811257.
It is not an unprimeable number, because it can be changed into a prime (13939811267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 434382 + ... + 465367.
It is an arithmetic number, because the mean of its divisors is an integer number (3485181625).
Almost surely, 213939811257 is an apocalyptic number.
It is an amenable number.
13939811257 is a deficient number, since it is larger than the sum of its proper divisors (915243).
13939811257 is an equidigital number, since it uses as much as digits as its factorization.
13939811257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 915242.
The product of its digits is 408240, while the sum is 49.
The spelling of 13939811257 in words is "thirteen billion, nine hundred thirty-nine million, eight hundred eleven thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •