Base | Representation |
---|---|
bin | 10011101010010100101… |
… | …100111111111110110001 |
3 | 11210011110111101220022102 |
4 | 103222110230333332301 |
5 | 134114040311232223 |
6 | 2512405441550145 |
7 | 166420610141465 |
oct | 23522454777661 |
9 | 4704414356272 |
10 | 1351114555313 |
11 | 481005a41136 |
12 | 199a31645355 |
13 | 9a542a42c43 |
14 | 49573d264a5 |
15 | 2522b578928 |
hex | 13a94b3ffb1 |
1351114555313 has 2 divisors, whose sum is σ = 1351114555314. Its totient is φ = 1351114555312.
The previous prime is 1351114555249. The next prime is 1351114555333. The reversal of 1351114555313 is 3135554111531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1215920825344 + 135193729969 = 1102688^2 + 367687^2 .
It is a cyclic number.
It is not a de Polignac number, because 1351114555313 - 26 = 1351114555249 is a prime.
It is not a weakly prime, because it can be changed into another prime (1351114555333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675557277656 + 675557277657.
It is an arithmetic number, because the mean of its divisors is an integer number (675557277657).
Almost surely, 21351114555313 is an apocalyptic number.
It is an amenable number.
1351114555313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1351114555313 is an equidigital number, since it uses as much as digits as its factorization.
1351114555313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 67500, while the sum is 38.
Adding to 1351114555313 its reverse (3135554111531), we get a palindrome (4486668666844).
The spelling of 1351114555313 in words is "one trillion, three hundred fifty-one billion, one hundred fourteen million, five hundred fifty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •