Base | Representation |
---|---|
bin | 10110111101111001110101… |
… | …011011011101101100001001 |
3 | 111020122120002000212202200012 |
4 | 112331321311123131230021 |
5 | 101214431022304013342 |
6 | 554455452353121305 |
7 | 30163543005643301 |
oct | 2675716533355411 |
9 | 436576060782605 |
10 | 101011011001097 |
11 | 2a2045903a417a |
12 | b3b473b259235 |
13 | 44493b36bb542 |
14 | 1ad2d5d790601 |
15 | ba27dca49b82 |
hex | 5bde756ddb09 |
101011011001097 has 2 divisors, whose sum is σ = 101011011001098. Its totient is φ = 101011011001096.
The previous prime is 101011011001073. The next prime is 101011011001123. The reversal of 101011011001097 is 790100110110101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91175360919241 + 9835650081856 = 9548579^2 + 3136184^2 .
It is a cyclic number.
It is not a de Polignac number, because 101011011001097 - 216 = 101011010935561 is a prime.
It is not a weakly prime, because it can be changed into another prime (101011011001037) 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, 50505505500548 + 50505505500549.
It is an arithmetic number, because the mean of its divisors is an integer number (50505505500549).
Almost surely, 2101011011001097 is an apocalyptic number.
It is an amenable number.
101011011001097 is a deficient number, since it is larger than the sum of its proper divisors (1).
101011011001097 is an equidigital number, since it uses as much as digits as its factorization.
101011011001097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63, while the sum is 23.
Adding to 101011011001097 its reverse (790100110110101), we get a palindrome (891111121111198).
The spelling of 101011011001097 in words is "one hundred one trillion, eleven billion, eleven million, one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •