Base | Representation |
---|---|
bin | 1011111011000110100011… |
… | …1101010110100010101011 |
3 | 1201102022012111222102220021 |
4 | 2332301220331112202223 |
5 | 3204243240240212341 |
6 | 43514352405541311 |
7 | 2522111022465565 |
oct | 276615075264253 |
9 | 51368174872807 |
10 | 13110001100971 |
11 | 41a4a13931aa5 |
12 | 1578980a14837 |
13 | 74136347c488 |
14 | 334755414335 |
15 | 17b04b8ea9d1 |
hex | bec68f568ab |
13110001100971 has 2 divisors, whose sum is σ = 13110001100972. Its totient is φ = 13110001100970.
The previous prime is 13110001100957. The next prime is 13110001101017. The reversal of 13110001100971 is 17900110001131.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13110001100971 - 217 = 13110000969899 is a prime.
It is not a weakly prime, because it can be changed into another prime (13110001100071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555000550485 + 6555000550486.
It is an arithmetic number, because the mean of its divisors is an integer number (6555000550486).
Almost surely, 213110001100971 is an apocalyptic number.
13110001100971 is a deficient number, since it is larger than the sum of its proper divisors (1).
13110001100971 is an equidigital number, since it uses as much as digits as its factorization.
13110001100971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 189, while the sum is 25.
The spelling of 13110001100971 in words is "thirteen trillion, one hundred ten billion, one million, one hundred thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •