Base | Representation |
---|---|
bin | 10111011101100011001111… |
… | …111000101100111010100001 |
3 | 111112100110112120022122120112 |
4 | 113131203033320230322201 |
5 | 102011043440202114344 |
6 | 1003242521024421105 |
7 | 30506632605000236 |
oct | 2735431770547241 |
9 | 445313476278515 |
10 | 103185782066849 |
11 | 2a972931a24479 |
12 | b6a6119777795 |
13 | 45764ba490401 |
14 | 1b6a30b7c378d |
15 | bde174156c9e |
hex | 5dd8cfe2cea1 |
103185782066849 has 2 divisors, whose sum is σ = 103185782066850. Its totient is φ = 103185782066848.
The previous prime is 103185782066839. The next prime is 103185782066893. The reversal of 103185782066849 is 948660287581301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 69864522250000 + 33321259816849 = 8358500^2 + 5772457^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103185782066849 is a prime.
It is not a weakly prime, because it can be changed into another prime (103185782066839) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51592891033424 + 51592891033425.
It is an arithmetic number, because the mean of its divisors is an integer number (51592891033425).
It is a 2-persistent number, because it is pandigital, and so is 2⋅103185782066849 = 206371564133698, but 3⋅103185782066849 = 309557346200547 is not.
Almost surely, 2103185782066849 is an apocalyptic number.
It is an amenable number.
103185782066849 is a deficient number, since it is larger than the sum of its proper divisors (1).
103185782066849 is an equidigital number, since it uses as much as digits as its factorization.
103185782066849 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139345920, while the sum is 68.
The spelling of 103185782066849 in words is "one hundred three trillion, one hundred eighty-five billion, seven hundred eighty-two million, sixty-six thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •