Base | Representation |
---|---|
bin | 11000010001011100… |
… | …00101100110010011 |
3 | 1020122011111121102102 |
4 | 30020232011212103 |
5 | 203141441414141 |
6 | 5553023511015 |
7 | 640632245102 |
oct | 141056054623 |
9 | 36564447372 |
10 | 13031201171 |
11 | 558785634a |
12 | 263815846b |
13 | 12c89a7631 |
14 | 8b896c039 |
15 | 51406699b |
hex | 308b85993 |
13031201171 has 2 divisors, whose sum is σ = 13031201172. Its totient is φ = 13031201170.
The previous prime is 13031201159. The next prime is 13031201179. The reversal of 13031201171 is 17110213031.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13031201171 is a prime.
It is not a weakly prime, because it can be changed into another prime (13031201179) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6515600585 + 6515600586.
It is an arithmetic number, because the mean of its divisors is an integer number (6515600586).
Almost surely, 213031201171 is an apocalyptic number.
13031201171 is a deficient number, since it is larger than the sum of its proper divisors (1).
13031201171 is an equidigital number, since it uses as much as digits as its factorization.
13031201171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 20.
The spelling of 13031201171 in words is "thirteen billion, thirty-one million, two hundred one thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •