Base | Representation |
---|---|
bin | 10011101011001101000… |
… | …110000000100100110001 |
3 | 11210020220102121202021011 |
4 | 103223031012000210301 |
5 | 134123010010313231 |
6 | 2513043355430521 |
7 | 166453215530545 |
oct | 23531506004461 |
9 | 4706812552234 |
10 | 1352060635441 |
11 | 481450a8713a |
12 | 19a056455441 |
13 | 9a663a51779 |
14 | 49623839a25 |
15 | 252846589b1 |
hex | 13acd180931 |
1352060635441 has 2 divisors, whose sum is σ = 1352060635442. Its totient is φ = 1352060635440.
The previous prime is 1352060635439. The next prime is 1352060635451. The reversal of 1352060635441 is 1445360602531.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1346827559841 + 5233075600 = 1160529^2 + 72340^2 .
It is a cyclic number.
It is not a de Polignac number, because 1352060635441 - 21 = 1352060635439 is a prime.
Together with 1352060635439, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1352060635394 and 1352060635403.
It is not a weakly prime, because it can be changed into another prime (1352060635451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 676030317720 + 676030317721.
It is an arithmetic number, because the mean of its divisors is an integer number (676030317721).
Almost surely, 21352060635441 is an apocalyptic number.
It is an amenable number.
1352060635441 is a deficient number, since it is larger than the sum of its proper divisors (1).
1352060635441 is an equidigital number, since it uses as much as digits as its factorization.
1352060635441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 259200, while the sum is 40.
The spelling of 1352060635441 in words is "one trillion, three hundred fifty-two billion, sixty million, six hundred thirty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •