Base | Representation |
---|---|
bin | 11011110100111011… |
… | …11011010000001001 |
3 | 1102120011102122100111 |
4 | 31322131323100021 |
5 | 221044012121423 |
6 | 10510234434321 |
7 | 1036134140152 |
oct | 157235732011 |
9 | 42504378314 |
10 | 14939567113 |
11 | 6376aa5989 |
12 | 2a8b2929a1 |
13 | 154117a053 |
14 | a1a1b2929 |
15 | 5c687860d |
hex | 37a77b409 |
14939567113 has 2 divisors, whose sum is σ = 14939567114. Its totient is φ = 14939567112.
The previous prime is 14939567101. The next prime is 14939567119. The reversal of 14939567113 is 31176593941.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13457856064 + 1481711049 = 116008^2 + 38493^2 .
It is a cyclic number.
It is not a de Polignac number, because 14939567113 - 25 = 14939567081 is a prime.
It is not a weakly prime, because it can be changed into another prime (14939567119) 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 as a sum of consecutive naturals, namely, 7469783556 + 7469783557.
It is an arithmetic number, because the mean of its divisors is an integer number (7469783557).
Almost surely, 214939567113 is an apocalyptic number.
It is an amenable number.
14939567113 is a deficient number, since it is larger than the sum of its proper divisors (1).
14939567113 is an equidigital number, since it uses as much as digits as its factorization.
14939567113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 612360, while the sum is 49.
The spelling of 14939567113 in words is "fourteen billion, nine hundred thirty-nine million, five hundred sixty-seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •