Base | Representation |
---|---|
bin | 1011111101111101010010… |
… | …1110111100011011010011 |
3 | 1201120222211002110222221221 |
4 | 2333133110232330123103 |
5 | 3211044220244403241 |
6 | 43553104053425511 |
7 | 2525465423440102 |
oct | 277372456743323 |
9 | 51528732428857 |
10 | 13159053903571 |
11 | 42137a5966684 |
12 | 158639063b297 |
13 | 745b7cc0bc64 |
14 | 336c8a020039 |
15 | 17c46d03e5d1 |
hex | bf7d4bbc6d3 |
13159053903571 has 2 divisors, whose sum is σ = 13159053903572. Its totient is φ = 13159053903570.
The previous prime is 13159053903551. The next prime is 13159053903617. The reversal of 13159053903571 is 17530935095131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13159053903571 - 229 = 13158517032659 is a prime.
It is not a weakly prime, because it can be changed into another prime (13159053903551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6579526951785 + 6579526951786.
It is an arithmetic number, because the mean of its divisors is an integer number (6579526951786).
Almost surely, 213159053903571 is an apocalyptic number.
13159053903571 is a deficient number, since it is larger than the sum of its proper divisors (1).
13159053903571 is an equidigital number, since it uses as much as digits as its factorization.
13159053903571 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1913625, while the sum is 52.
The spelling of 13159053903571 in words is "thirteen trillion, one hundred fifty-nine billion, fifty-three million, nine hundred three thousand, five hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •