Base | Representation |
---|---|
bin | 1011111110000101100001… |
… | …0011100010100110110111 |
3 | 1201121012111221002222122221 |
4 | 2333201120103202212313 |
5 | 3211113230343444224 |
6 | 43554111110103211 |
7 | 2525604216214342 |
oct | 277413023424667 |
9 | 51535457088587 |
10 | 13161261312439 |
11 | 4214728996629 |
12 | 15868a794ab07 |
13 | 746142335956 |
14 | 337019269459 |
15 | 17c54bc216e4 |
hex | bf8584e29b7 |
13161261312439 has 2 divisors, whose sum is σ = 13161261312440. Its totient is φ = 13161261312438.
The previous prime is 13161261312413. The next prime is 13161261312457. The reversal of 13161261312439 is 93421316216131.
It is a strong prime.
It is an emirp because it is prime and its reverse (93421316216131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13161261312439 - 215 = 13161261279671 is a prime.
It is a super-3 number, since 3×131612613124393 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 13161261312395 and 13161261312404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13161261312839) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6580630656219 + 6580630656220.
It is an arithmetic number, because the mean of its divisors is an integer number (6580630656220).
Almost surely, 213161261312439 is an apocalyptic number.
13161261312439 is a deficient number, since it is larger than the sum of its proper divisors (1).
13161261312439 is an equidigital number, since it uses as much as digits as its factorization.
13161261312439 is an evil number, because the sum of its binary digits is even.
The product of its digits is 139968, while the sum is 43.
The spelling of 13161261312439 in words is "thirteen trillion, one hundred sixty-one billion, two hundred sixty-one million, three hundred twelve thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •