Base | Representation |
---|---|
bin | 10110111111010110111101… |
… | …110101011000000010111001 |
3 | 111021000010012010122022011021 |
4 | 112333112331311120002321 |
5 | 101223100322030013311 |
6 | 555013431242502441 |
7 | 30204013041265303 |
oct | 2677267565300271 |
9 | 437003163568137 |
10 | 101111010001081 |
11 | 2a242a36206a13 |
12 | b40bba8804a21 |
13 | 445595bc3aa52 |
14 | 1ad7b28630973 |
15 | ba51e1b38171 |
hex | 5bf5bdd580b9 |
101111010001081 has 2 divisors, whose sum is σ = 101111010001082. Its totient is φ = 101111010001080.
The previous prime is 101111010000991. The next prime is 101111010001153. The reversal of 101111010001081 is 180100010111101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99712606784400 + 1398403216681 = 9985620^2 + 1182541^2 .
It is a cyclic number.
It is not a de Polignac number, because 101111010001081 - 241 = 98911986745529 is a prime.
It is a super-2 number, since 2×1011110100010812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101111010001481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555505000540 + 50555505000541.
It is an arithmetic number, because the mean of its divisors is an integer number (50555505000541).
Almost surely, 2101111010001081 is an apocalyptic number.
It is an amenable number.
101111010001081 is a deficient number, since it is larger than the sum of its proper divisors (1).
101111010001081 is an equidigital number, since it uses as much as digits as its factorization.
101111010001081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 101111010001081 its reverse (180100010111101), we get a palindrome (281211020112182).
The spelling of 101111010001081 in words is "one hundred one trillion, one hundred eleven billion, ten million, one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •