Base | Representation |
---|---|
bin | 10011111011001000101… |
… | …010010011000100010101 |
3 | 11211220001112121222112101 |
4 | 103323020222103010111 |
5 | 134413023012201402 |
6 | 2524553005522101 |
7 | 200630133044434 |
oct | 23731052230425 |
9 | 4756045558471 |
10 | 1369166131477 |
11 | 488729650521 |
12 | 1a142ab73331 |
13 | 9c15b861161 |
14 | 4a3a753b11b |
15 | 2593621db87 |
hex | 13ec8a93115 |
1369166131477 has 2 divisors, whose sum is σ = 1369166131478. Its totient is φ = 1369166131476.
The previous prime is 1369166131457. The next prime is 1369166131481. The reversal of 1369166131477 is 7741316619631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1363829244561 + 5336886916 = 1167831^2 + 73054^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1369166131477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1369166131457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 684583065738 + 684583065739.
It is an arithmetic number, because the mean of its divisors is an integer number (684583065739).
Almost surely, 21369166131477 is an apocalyptic number.
It is an amenable number.
1369166131477 is a deficient number, since it is larger than the sum of its proper divisors (1).
1369166131477 is an equidigital number, since it uses as much as digits as its factorization.
1369166131477 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3429216, while the sum is 55.
The spelling of 1369166131477 in words is "one trillion, three hundred sixty-nine billion, one hundred sixty-six million, one hundred thirty-one thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •