Base | Representation |
---|---|
bin | 1100101010000001101111… |
… | …0110001000001011011011 |
3 | 1211021101001012110022011201 |
4 | 3022200123312020023123 |
5 | 3311000244232310042 |
6 | 45332555102535031 |
7 | 2634260306413414 |
oct | 312403366101333 |
9 | 54241035408151 |
10 | 13916161213147 |
11 | 44858a1236196 |
12 | 1689066297477 |
13 | 79c39972442b |
14 | 36178d94680b |
15 | 191ed09011b7 |
hex | ca81bd882db |
13916161213147 has 2 divisors, whose sum is σ = 13916161213148. Its totient is φ = 13916161213146.
The previous prime is 13916161213027. The next prime is 13916161213169. The reversal of 13916161213147 is 74131216161931.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13916161213147 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13916161213097 and 13916161213106.
It is not a weakly prime, because it can be changed into another prime (13916167213147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6958080606573 + 6958080606574.
It is an arithmetic number, because the mean of its divisors is an integer number (6958080606574).
Almost surely, 213916161213147 is an apocalyptic number.
13916161213147 is a deficient number, since it is larger than the sum of its proper divisors (1).
13916161213147 is an equidigital number, since it uses as much as digits as its factorization.
13916161213147 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 163296, while the sum is 46.
The spelling of 13916161213147 in words is "thirteen trillion, nine hundred sixteen billion, one hundred sixty-one million, two hundred thirteen thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •