Base | Representation |
---|---|
bin | 1011111110000101011110… |
… | …1000011100101101000111 |
3 | 1201121012111010212001221221 |
4 | 2333201113220130231013 |
5 | 3211113220001003241 |
6 | 43554110024021211 |
7 | 2525604021205333 |
oct | 277412750345507 |
9 | 51535433761857 |
10 | 13161250016071 |
11 | 4214722580493 |
12 | 15868a4001807 |
13 | 74613cbac001 |
14 | 3370179687c3 |
15 | 17c54ac3e5d1 |
hex | bf857a1cb47 |
13161250016071 has 2 divisors, whose sum is σ = 13161250016072. Its totient is φ = 13161250016070.
The previous prime is 13161250016059. The next prime is 13161250016107. The reversal of 13161250016071 is 17061005216131.
Together with next prime (13161250016107) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (17061005216131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13161250016071 - 25 = 13161250016039 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13161250616071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6580625008035 + 6580625008036.
It is an arithmetic number, because the mean of its divisors is an integer number (6580625008036).
Almost surely, 213161250016071 is an apocalyptic number.
13161250016071 is a deficient number, since it is larger than the sum of its proper divisors (1).
13161250016071 is an equidigital number, since it uses as much as digits as its factorization.
13161250016071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 34.
The spelling of 13161250016071 in words is "thirteen trillion, one hundred sixty-one billion, two hundred fifty million, sixteen thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •