Base | Representation |
---|---|
bin | 11010101011111001… |
… | …11110011101010001 |
3 | 1100222110200110021011 |
4 | 31111330332131101 |
5 | 213320144342323 |
6 | 10325352130521 |
7 | 1015015030456 |
oct | 152574763521 |
9 | 40873613234 |
10 | 14326949713 |
11 | 609220a40a |
12 | 293a096a41 |
13 | 147428444b |
14 | 99caa382d |
15 | 58cbb720d |
hex | 355f3e751 |
14326949713 has 2 divisors, whose sum is σ = 14326949714. Its totient is φ = 14326949712.
The previous prime is 14326949669. The next prime is 14326949717. The reversal of 14326949713 is 31794962341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13420759104 + 906190609 = 115848^2 + 30103^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14326949713 is a prime.
It is a super-2 number, since 2×143269497132 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14326949717) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7163474856 + 7163474857.
It is an arithmetic number, because the mean of its divisors is an integer number (7163474857).
Almost surely, 214326949713 is an apocalyptic number.
It is an amenable number.
14326949713 is a deficient number, since it is larger than the sum of its proper divisors (1).
14326949713 is an equidigital number, since it uses as much as digits as its factorization.
14326949713 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 979776, while the sum is 49.
The spelling of 14326949713 in words is "fourteen billion, three hundred twenty-six million, nine hundred forty-nine thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •