Base | Representation |
---|---|
bin | 1011111110000101011110… |
… | …1000011100101110001101 |
3 | 1201121012111010212002001112 |
4 | 2333201113220130232031 |
5 | 3211113220001004031 |
6 | 43554110024021405 |
7 | 2525604021205463 |
oct | 277412750345615 |
9 | 51535433762045 |
10 | 13161250016141 |
11 | 4214722580547 |
12 | 15868a4001865 |
13 | 74613cbac056 |
14 | 337017968833 |
15 | 17c54ac3e62b |
hex | bf857a1cb8d |
13161250016141 has 2 divisors, whose sum is σ = 13161250016142. Its totient is φ = 13161250016140.
The previous prime is 13161250016107. The next prime is 13161250016227. The reversal of 13161250016141 is 14161005216131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12636283110025 + 524966906116 = 3554755^2 + 724546^2 .
It is an emirp because it is prime and its reverse (14161005216131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13161250016141 - 222 = 13161245821837 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13161250016098 and 13161250016107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13161250016441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6580625008070 + 6580625008071.
It is an arithmetic number, because the mean of its divisors is an integer number (6580625008071).
Almost surely, 213161250016141 is an apocalyptic number.
It is an amenable number.
13161250016141 is a deficient number, since it is larger than the sum of its proper divisors (1).
13161250016141 is an equidigital number, since it uses as much as digits as its factorization.
13161250016141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 32.
The spelling of 13161250016141 in words is "thirteen trillion, one hundred sixty-one billion, two hundred fifty million, sixteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •