Base | Representation |
---|---|
bin | 10011110011110101001… |
… | …011110000101100111001 |
3 | 11211010210221201002012211 |
4 | 103303311023300230321 |
5 | 134300442212312041 |
6 | 2521214435535121 |
7 | 200231566664413 |
oct | 23636513605471 |
9 | 4733727632184 |
10 | 1361323166521 |
11 | 48537448a8aa |
12 | 19ba0045a4a1 |
13 | 9b4aba110a6 |
14 | 49c61a6d9b3 |
15 | 256278e2481 |
hex | 13cf52f0b39 |
1361323166521 has 2 divisors, whose sum is σ = 1361323166522. Its totient is φ = 1361323166520.
The previous prime is 1361323166479. The next prime is 1361323166561. The reversal of 1361323166521 is 1256613231631.
It is an a-pointer prime, because the next prime (1361323166561) can be obtained adding 1361323166521 to its sum of digits (40).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 907181956521 + 454141210000 = 952461^2 + 673900^2 .
It is a cyclic number.
It is not a de Polignac number, because 1361323166521 - 27 = 1361323166393 is a prime.
It is not a weakly prime, because it can be changed into another prime (1361323166561) 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, 680661583260 + 680661583261.
It is an arithmetic number, because the mean of its divisors is an integer number (680661583261).
Almost surely, 21361323166521 is an apocalyptic number.
It is an amenable number.
1361323166521 is a deficient number, since it is larger than the sum of its proper divisors (1).
1361323166521 is an equidigital number, since it uses as much as digits as its factorization.
1361323166521 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 116640, while the sum is 40.
The spelling of 1361323166521 in words is "one trillion, three hundred sixty-one billion, three hundred twenty-three million, one hundred sixty-six thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •