Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …001100010010110110011001 |
3 | 111020222011100112002010102212 |
4 | 112333031221030102312121 |
5 | 101222414322000324121 |
6 | 555005054102004505 |
7 | 30203210012625233 |
oct | 2677155114226631 |
9 | 436864315063385 |
10 | 101101000011161 |
11 | 2a239769899377 |
12 | b40a074416735 |
13 | 4454a251634a7 |
14 | 1ad745902b253 |
15 | ba4d07e5525b |
hex | 5bf369312d99 |
101101000011161 has 2 divisors, whose sum is σ = 101101000011162. Its totient is φ = 101101000011160.
The previous prime is 101101000011149. The next prime is 101101000011283. The reversal of 101101000011161 is 161110000101101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94951869705625 + 6149130305536 = 9744325^2 + 2479744^2 .
It is a cyclic number.
It is not a de Polignac number, because 101101000011161 - 222 = 101100995816857 is a prime.
It is a super-3 number, since 3×1011010000111613 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (101101000011061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550500005580 + 50550500005581.
It is an arithmetic number, because the mean of its divisors is an integer number (50550500005581).
Almost surely, 2101101000011161 is an apocalyptic number.
It is an amenable number.
101101000011161 is a deficient number, since it is larger than the sum of its proper divisors (1).
101101000011161 is an equidigital number, since it uses as much as digits as its factorization.
101101000011161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 14.
Adding to 101101000011161 its reverse (161110000101101), we get a palindrome (262211000112262).
The spelling of 101101000011161 in words is "one hundred one trillion, one hundred one billion, eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •