Base | Representation |
---|---|
bin | 10110111111001101101111… |
… | …001101111011111101101001 |
3 | 111020222011121120022020010011 |
4 | 112333031233031323331221 |
5 | 101222420023340330001 |
6 | 555005112112451521 |
7 | 30203212351124404 |
oct | 2677155715737551 |
9 | 436864546266104 |
10 | 101101101105001 |
11 | 2a2398109676a8 |
12 | b40a0a2249ba1 |
13 | 4454a4009ab2a |
14 | 1ad7468624d3b |
15 | ba4d11c73d51 |
hex | 5bf36f37bf69 |
101101101105001 has 2 divisors, whose sum is σ = 101101101105002. Its totient is φ = 101101101105000.
The previous prime is 101101101104947. The next prime is 101101101105019. The reversal of 101101101105001 is 100501101101101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83670901952400 + 17430199152601 = 9147180^2 + 4174949^2 .
It is a cyclic number.
It is not a de Polignac number, because 101101101105001 - 231 = 101098953621353 is a prime.
It is not a weakly prime, because it can be changed into another prime (101101101105041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550550552500 + 50550550552501.
It is an arithmetic number, because the mean of its divisors is an integer number (50550550552501).
Almost surely, 2101101101105001 is an apocalyptic number.
It is an amenable number.
101101101105001 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101101105001 is an equidigital number, since it uses as much as digits as its factorization.
101101101105001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5, while the sum is 13.
Adding to 101101101105001 its reverse (100501101101101), we get a palindrome (201602202206102).
The spelling of 101101101105001 in words is "one hundred one trillion, one hundred one billion, one hundred one million, one hundred five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •