Base | Representation |
---|---|
bin | 10011110100000001110… |
… | …011111011100000111001 |
3 | 11211011100201100111220001 |
4 | 103310001303323200321 |
5 | 134301410431220121 |
6 | 2521251444433001 |
7 | 200240051513305 |
oct | 23640163734071 |
9 | 4734321314801 |
10 | 1361535023161 |
11 | 485473030935 |
12 | 19ba5b3a8761 |
13 | 9b51388a051 |
14 | 49c81c5ad05 |
15 | 2563b2de991 |
hex | 13d01cfb839 |
1361535023161 has 2 divisors, whose sum is σ = 1361535023162. Its totient is φ = 1361535023160.
The previous prime is 1361535023111. The next prime is 1361535023171. The reversal of 1361535023161 is 1613205351631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1219975475625 + 141559547536 = 1104525^2 + 376244^2 .
It is a cyclic number.
It is not a de Polignac number, because 1361535023161 - 213 = 1361535014969 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1361535023161.
It is not a weakly prime, because it can be changed into another prime (1361535023111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 680767511580 + 680767511581.
It is an arithmetic number, because the mean of its divisors is an integer number (680767511581).
Almost surely, 21361535023161 is an apocalyptic number.
It is an amenable number.
1361535023161 is a deficient number, since it is larger than the sum of its proper divisors (1).
1361535023161 is an equidigital number, since it uses as much as digits as its factorization.
1361535023161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48600, while the sum is 37.
The spelling of 1361535023161 in words is "one trillion, three hundred sixty-one billion, five hundred thirty-five million, twenty-three thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •