Base | Representation |
---|---|
bin | 10011101110010101101… |
… | …001010101110001011101 |
3 | 11210120120220220110220101 |
4 | 103232111221111301131 |
5 | 134201402341344014 |
6 | 2514401313021101 |
7 | 166632463204402 |
oct | 23562551256135 |
9 | 4716526813811 |
10 | 1355425340509 |
11 | 4829182a5929 |
12 | 19a835254791 |
13 | 9aa7bb6a506 |
14 | 4986265a2a9 |
15 | 253cec3d474 |
hex | 13b95a55c5d |
1355425340509 has 2 divisors, whose sum is σ = 1355425340510. Its totient is φ = 1355425340508.
The previous prime is 1355425340501. The next prime is 1355425340519. The reversal of 1355425340509 is 9050435245531.
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., 1040869252900 + 314556087609 = 1020230^2 + 560853^2 .
It is an emirp because it is prime and its reverse (9050435245531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1355425340509 - 23 = 1355425340501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1355425340501) 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, 677712670254 + 677712670255.
It is an arithmetic number, because the mean of its divisors is an integer number (677712670255).
Almost surely, 21355425340509 is an apocalyptic number.
It is an amenable number.
1355425340509 is a deficient number, since it is larger than the sum of its proper divisors (1).
1355425340509 is an equidigital number, since it uses as much as digits as its factorization.
1355425340509 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620000, while the sum is 46.
The spelling of 1355425340509 in words is "one trillion, three hundred fifty-five billion, four hundred twenty-five million, three hundred forty thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •