Base | Representation |
---|---|
bin | 10011110011111000000… |
… | …010010101000001000101 |
3 | 11211010221021202120100202 |
4 | 103303320002111001011 |
5 | 134301041440303402 |
6 | 2521223305420245 |
7 | 200233020534041 |
oct | 23637002250105 |
9 | 4733837676322 |
10 | 1361371025477 |
11 | 4853994a8a61 |
12 | 19ba1449a685 |
13 | 9b4b88c9ab8 |
14 | 49c6816b021 |
15 | 2562bbe7b02 |
hex | 13cf8095045 |
1361371025477 has 2 divisors, whose sum is σ = 1361371025478. Its totient is φ = 1361371025476.
The previous prime is 1361371025471. The next prime is 1361371025527. The reversal of 1361371025477 is 7745201731631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 782533082881 + 578837942596 = 884609^2 + 760814^2 .
It is a cyclic number.
It is not a de Polignac number, because 1361371025477 - 28 = 1361371025221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1361371025471) 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, 680685512738 + 680685512739.
It is an arithmetic number, because the mean of its divisors is an integer number (680685512739).
Almost surely, 21361371025477 is an apocalyptic number.
It is an amenable number.
1361371025477 is a deficient number, since it is larger than the sum of its proper divisors (1).
1361371025477 is an equidigital number, since it uses as much as digits as its factorization.
1361371025477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 740880, while the sum is 47.
The spelling of 1361371025477 in words is "one trillion, three hundred sixty-one billion, three hundred seventy-one million, twenty-five thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •