Base | Representation |
---|---|
bin | 10110100100100100011… |
… | …100100110000011001001 |
3 | 12111021122110021021121201 |
4 | 112210210130212003021 |
5 | 200403120213411023 |
6 | 3144321341504201 |
7 | 220030400103424 |
oct | 26444434460311 |
9 | 5437573237551 |
10 | 1551094669513 |
11 | 5488a755a894 |
12 | 210742572061 |
13 | b3362bbb96c |
14 | 5510550c9bb |
15 | 2a532dc0bad |
hex | 169247260c9 |
1551094669513 has 2 divisors, whose sum is σ = 1551094669514. Its totient is φ = 1551094669512.
The previous prime is 1551094669459. The next prime is 1551094669517. The reversal of 1551094669513 is 3159664901551.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1498988846224 + 52105823289 = 1224332^2 + 228267^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1551094669513 is a prime.
It is not a weakly prime, because it can be changed into another prime (1551094669517) 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, 775547334756 + 775547334757.
It is an arithmetic number, because the mean of its divisors is an integer number (775547334757).
Almost surely, 21551094669513 is an apocalyptic number.
It is an amenable number.
1551094669513 is a deficient number, since it is larger than the sum of its proper divisors (1).
1551094669513 is an equidigital number, since it uses as much as digits as its factorization.
1551094669513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4374000, while the sum is 55.
The spelling of 1551094669513 in words is "one trillion, five hundred fifty-one billion, ninety-four million, six hundred sixty-nine thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •