Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …110001110101001111110101 |
3 | 111020121111200102110101002211 |
4 | 112331233211301311033311 |
5 | 101214241010304323221 |
6 | 554450433045133421 |
7 | 30163003266401431 |
oct | 2675574561651765 |
9 | 436544612411084 |
10 | 101000011011061 |
11 | 2a1aa956172918 |
12 | b3b258b3ba271 |
13 | 444834c7985b6 |
14 | 1ad25d88c39c1 |
15 | ba2396ead6e1 |
hex | 5bdbe5c753f5 |
101000011011061 has 2 divisors, whose sum is σ = 101000011011062. Its totient is φ = 101000011011060.
The previous prime is 101000011011023. The next prime is 101000011011103. The reversal of 101000011011061 is 160110110000101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71950940112100 + 29049070898961 = 8482390^2 + 5389719^2 .
It is a cyclic number.
It is not a de Polignac number, because 101000011011061 - 219 = 101000010486773 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101000011011461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500005505530 + 50500005505531.
It is an arithmetic number, because the mean of its divisors is an integer number (50500005505531).
Almost surely, 2101000011011061 is an apocalyptic number.
It is an amenable number.
101000011011061 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000011011061 is an equidigital number, since it uses as much as digits as its factorization.
101000011011061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 101000011011061 its reverse (160110110000101), we get a palindrome (261110121011162).
The spelling of 101000011011061 in words is "one hundred one trillion, eleven million, eleven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •