Base | Representation |
---|---|
bin | 10111011111001110110110… |
… | …000100101111101001011011 |
3 | 111112202111202010101220111221 |
4 | 113133032312010233221123 |
5 | 102014442042130230042 |
6 | 1003411545040232511 |
7 | 30521162560601353 |
oct | 2737166604575133 |
9 | 445674663356457 |
10 | 103301313133147 |
11 | 2aa07928227558 |
12 | b7045a090b737 |
13 | 458436c85a3bc |
14 | 1b71b4b3c9b63 |
15 | be2186b08d67 |
hex | 5df3b612fa5b |
103301313133147 has 2 divisors, whose sum is σ = 103301313133148. Its totient is φ = 103301313133146.
The previous prime is 103301313133093. The next prime is 103301313133199. The reversal of 103301313133147 is 741331313103301.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103301313133147 is a prime.
It is a super-2 number, since 2×1033013131331472 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103301313139147) 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, 51650656566573 + 51650656566574.
It is an arithmetic number, because the mean of its divisors is an integer number (51650656566574).
Almost surely, 2103301313133147 is an apocalyptic number.
103301313133147 is a deficient number, since it is larger than the sum of its proper divisors (1).
103301313133147 is an equidigital number, since it uses as much as digits as its factorization.
103301313133147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20412, while the sum is 34.
Adding to 103301313133147 its reverse (741331313103301), we get a palindrome (844632626236448).
The spelling of 103301313133147 in words is "one hundred three trillion, three hundred one billion, three hundred thirteen million, one hundred thirty-three thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •