Base | Representation |
---|---|
bin | 10011001000001001010… |
… | …010000010010110000001 |
3 | 11122122201220001200112221 |
4 | 103020021102002112001 |
5 | 133013410410400323 |
6 | 2443500110251041 |
7 | 163651306145152 |
oct | 23101122022601 |
9 | 4578656050487 |
10 | 1314415715713 |
11 | 46749344a831 |
12 | 1928ab1b6a81 |
13 | 96c4488ac39 |
14 | 47891d57929 |
15 | 242ce7c355d |
hex | 13209482581 |
1314415715713 has 2 divisors, whose sum is σ = 1314415715714. Its totient is φ = 1314415715712.
The previous prime is 1314415715651. The next prime is 1314415715771. The reversal of 1314415715713 is 3175175144131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 720449556849 + 593966158864 = 848793^2 + 770692^2 .
It is a cyclic number.
It is not a de Polignac number, because 1314415715713 - 221 = 1314413618561 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1314415715713.
It is not a weakly prime, because it can be changed into another prime (1314415715413) 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 as a sum of consecutive naturals, namely, 657207857856 + 657207857857.
It is an arithmetic number, because the mean of its divisors is an integer number (657207857857).
Almost surely, 21314415715713 is an apocalyptic number.
It is an amenable number.
1314415715713 is a deficient number, since it is larger than the sum of its proper divisors (1).
1314415715713 is an equidigital number, since it uses as much as digits as its factorization.
1314415715713 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 176400, while the sum is 43.
The spelling of 1314415715713 in words is "one trillion, three hundred fourteen billion, four hundred fifteen million, seven hundred fifteen thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •