Base | Representation |
---|---|
bin | 1011111110000101101110… |
… | …0000111101010101011101 |
3 | 1201121012122200102210121021 |
4 | 2333201123200331111131 |
5 | 3211113333140131222 |
6 | 43554120312204141 |
7 | 2525605442012452 |
oct | 277413340752535 |
9 | 51535580383537 |
10 | 13161315161437 |
11 | 4214756326133 |
12 | 1586901999651 |
13 | 74615053ac71 |
14 | 337022485829 |
15 | 17c55180bac7 |
hex | bf85b83d55d |
13161315161437 has 2 divisors, whose sum is σ = 13161315161438. Its totient is φ = 13161315161436.
The previous prime is 13161315161417. The next prime is 13161315161503. The reversal of 13161315161437 is 73416151316131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12736411953721 + 424903207716 = 3568811^2 + 651846^2 .
It is a cyclic number.
It is not a de Polignac number, because 13161315161437 - 215 = 13161315128669 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13161315161393 and 13161315161402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13161315161417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6580657580718 + 6580657580719.
It is an arithmetic number, because the mean of its divisors is an integer number (6580657580719).
Almost surely, 213161315161437 is an apocalyptic number.
It is an amenable number.
13161315161437 is a deficient number, since it is larger than the sum of its proper divisors (1).
13161315161437 is an equidigital number, since it uses as much as digits as its factorization.
13161315161437 is an evil number, because the sum of its binary digits is even.
The product of its digits is 136080, while the sum is 43.
Adding to 13161315161437 its reverse (73416151316131), we get a palindrome (86577466477568).
The spelling of 13161315161437 in words is "thirteen trillion, one hundred sixty-one billion, three hundred fifteen million, one hundred sixty-one thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •