Base | Representation |
---|---|
bin | 10110111111010110001110… |
… | …001001100111100010111001 |
3 | 111021000001010101022002110122 |
4 | 112333112032021213202321 |
5 | 101223042202230013311 |
6 | 555013220024023025 |
7 | 30203654155351631 |
oct | 2677261611474271 |
9 | 437001111262418 |
10 | 101110210001081 |
11 | 2a242665676096 |
12 | b40ba04901a75 |
13 | 4455862287b78 |
14 | 1ad7a902a56c1 |
15 | ba51967b10db |
hex | 5bf58e2678b9 |
101110210001081 has 2 divisors, whose sum is σ = 101110210001082. Its totient is φ = 101110210001080.
The previous prime is 101110210000939. The next prime is 101110210001107. The reversal of 101110210001081 is 180100012011101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97499035705600 + 3611174295481 = 9874160^2 + 1900309^2 .
It is a cyclic number.
It is not a de Polignac number, because 101110210001081 - 214 = 101110209984697 is a prime.
It is a super-2 number, since 2×1011102100010812 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101110210000081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50555105000540 + 50555105000541.
It is an arithmetic number, because the mean of its divisors is an integer number (50555105000541).
Almost surely, 2101110210001081 is an apocalyptic number.
It is an amenable number.
101110210001081 is a deficient number, since it is larger than the sum of its proper divisors (1).
101110210001081 is an equidigital number, since it uses as much as digits as its factorization.
101110210001081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 101110210001081 its reverse (180100012011101), we get a palindrome (281210222012182).
The spelling of 101110210001081 in words is "one hundred one trillion, one hundred ten billion, two hundred ten million, one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •