Base | Representation |
---|---|
bin | 10110111111001100110100… |
… | …001101011001111111000001 |
3 | 111020222002001120110021101122 |
4 | 112333030310031121333001 |
5 | 101222411011421010311 |
6 | 555004425545442025 |
7 | 30203146000244006 |
oct | 2677146415317701 |
9 | 436862046407348 |
10 | 101100111110081 |
11 | 2a239353057886 |
12 | b409a667a0315 |
13 | 4454912c54915 |
14 | 1ad73b2d5d8ad |
15 | ba4ca4dbc0db |
hex | 5bf334359fc1 |
101100111110081 has 2 divisors, whose sum is σ = 101100111110082. Its totient is φ = 101100111110080.
The previous prime is 101100111110051. The next prime is 101100111110107. The reversal of 101100111110081 is 180011111001101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99279622055056 + 1820489055025 = 9963916^2 + 1349255^2 .
It is a cyclic number.
It is not a de Polignac number, because 101100111110081 - 210 = 101100111109057 is a prime.
It is a super-2 number, since 2×1011001111100812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101100111110051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50550055555040 + 50550055555041.
It is an arithmetic number, because the mean of its divisors is an integer number (50550055555041).
Almost surely, 2101100111110081 is an apocalyptic number.
It is an amenable number.
101100111110081 is a deficient number, since it is larger than the sum of its proper divisors (1).
101100111110081 is an equidigital number, since it uses as much as digits as its factorization.
101100111110081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 17.
Adding to 101100111110081 its reverse (180011111001101), we get a palindrome (281111222111182).
The spelling of 101100111110081 in words is "one hundred one trillion, one hundred billion, one hundred eleven million, one hundred ten thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •