Base | Representation |
---|---|
bin | 10110110011100110101111… |
… | …110101100000010000101101 |
3 | 111011010220101220212011221021 |
4 | 112303212233311200100231 |
5 | 101121332200223131221 |
6 | 553154413142534141 |
7 | 30061450543521163 |
oct | 2663465765402055 |
9 | 434126356764837 |
10 | 100303321302061 |
11 | 29a61443a77909 |
12 | b2bb557437351 |
13 | 43c77410a4b37 |
14 | 1aaa9c70b7233 |
15 | b8e1bd83d041 |
hex | 5b39afd6042d |
100303321302061 has 2 divisors, whose sum is σ = 100303321302062. Its totient is φ = 100303321302060.
The previous prime is 100303321302059. The next prime is 100303321302091. The reversal of 100303321302061 is 160203123303001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 77859358202025 + 22443963100036 = 8823795^2 + 4737506^2 .
It is a cyclic number.
It is not a de Polignac number, because 100303321302061 - 21 = 100303321302059 is a prime.
Together with 100303321302059, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100303321302091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50151660651030 + 50151660651031.
It is an arithmetic number, because the mean of its divisors is an integer number (50151660651031).
Almost surely, 2100303321302061 is an apocalyptic number.
It is an amenable number.
100303321302061 is a deficient number, since it is larger than the sum of its proper divisors (1).
100303321302061 is an equidigital number, since it uses as much as digits as its factorization.
100303321302061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 100303321302061 its reverse (160203123303001), we get a palindrome (260506444605062).
The spelling of 100303321302061 in words is "one hundred trillion, three hundred three billion, three hundred twenty-one million, three hundred two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •