Base | Representation |
---|---|
bin | 10011101011101010010… |
… | …110001110010110110101 |
3 | 11210022011122010110121022 |
4 | 103223222112032112311 |
5 | 134130011131103321 |
6 | 2513204211030525 |
7 | 166501325265335 |
oct | 23535226162665 |
9 | 4708148113538 |
10 | 1352551425461 |
11 | 481683022a25 |
12 | 19a17289b445 |
13 | 9a711630772 |
14 | 4966cab50c5 |
15 | 252b27a2dab |
hex | 13aea58e5b5 |
1352551425461 has 2 divisors, whose sum is σ = 1352551425462. Its totient is φ = 1352551425460.
The previous prime is 1352551425457. The next prime is 1352551425553. The reversal of 1352551425461 is 1645241552531.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1352380600561 + 170824900 = 1162919^2 + 13070^2 .
It is a cyclic number.
It is not a de Polignac number, because 1352551425461 - 22 = 1352551425457 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1352551425431) 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, 676275712730 + 676275712731.
It is an arithmetic number, because the mean of its divisors is an integer number (676275712731).
Almost surely, 21352551425461 is an apocalyptic number.
It is an amenable number.
1352551425461 is a deficient number, since it is larger than the sum of its proper divisors (1).
1352551425461 is an equidigital number, since it uses as much as digits as its factorization.
1352551425461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 720000, while the sum is 44.
Adding to 1352551425461 its reverse (1645241552531), we get a palindrome (2997792977992).
The spelling of 1352551425461 in words is "one trillion, three hundred fifty-two billion, five hundred fifty-one million, four hundred twenty-five thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •