Base | Representation |
---|---|
bin | 10011101110001001000… |
… | …100100010000110001101 |
3 | 11210120001012220211000012 |
4 | 103232021010202012031 |
5 | 134200434334140234 |
6 | 2514324335043005 |
7 | 166624322015555 |
oct | 23561104420615 |
9 | 4716035824005 |
10 | 1355214365069 |
11 | 48281a1a6964 |
12 | 19a796670465 |
13 | 9aa4723c686 |
14 | 4984261c165 |
15 | 253bb4670ce |
hex | 13b8912218d |
1355214365069 has 2 divisors, whose sum is σ = 1355214365070. Its totient is φ = 1355214365068.
The previous prime is 1355214364967. The next prime is 1355214365083. The reversal of 1355214365069 is 9605634125531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 734128516969 + 621085848100 = 856813^2 + 788090^2 .
It is a cyclic number.
It is not a de Polignac number, because 1355214365069 - 216 = 1355214299533 is a prime.
It is a super-2 number, since 2×13552143650692 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1355214361069) 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, 677607182534 + 677607182535.
It is an arithmetic number, because the mean of its divisors is an integer number (677607182535).
Almost surely, 21355214365069 is an apocalyptic number.
It is an amenable number.
1355214365069 is a deficient number, since it is larger than the sum of its proper divisors (1).
1355214365069 is an equidigital number, since it uses as much as digits as its factorization.
1355214365069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916000, while the sum is 50.
The spelling of 1355214365069 in words is "one trillion, three hundred fifty-five billion, two hundred fourteen million, three hundred sixty-five thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •