Base | Representation |
---|---|
bin | 10011000111001101000… |
… | …101111110110111000101 |
3 | 11122120010111221220000211 |
4 | 103013031011332313011 |
5 | 133004323404012012 |
6 | 2443211555035421 |
7 | 163614265066315 |
oct | 23071505766705 |
9 | 4576114856024 |
10 | 1313405922757 |
11 | 4670154483a5 |
12 | 192668b9bb71 |
13 | 96b13602506 |
14 | 477d7bbb445 |
15 | 24270d0a6a7 |
hex | 131cd17edc5 |
1313405922757 has 2 divisors, whose sum is σ = 1313405922758. Its totient is φ = 1313405922756.
The previous prime is 1313405922743. The next prime is 1313405922767. The reversal of 1313405922757 is 7572295043131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 897328031076 + 416077891681 = 947274^2 + 645041^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1313405922757 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1313405922757.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1313405922767) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656702961378 + 656702961379.
It is an arithmetic number, because the mean of its divisors is an integer number (656702961379).
Almost surely, 21313405922757 is an apocalyptic number.
It is an amenable number.
1313405922757 is a deficient number, since it is larger than the sum of its proper divisors (1).
1313405922757 is an equidigital number, since it uses as much as digits as its factorization.
1313405922757 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1587600, while the sum is 49.
The spelling of 1313405922757 in words is "one trillion, three hundred thirteen billion, four hundred five million, nine hundred twenty-two thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •