Base | Representation |
---|---|
bin | 10110111111011000000101… |
… | …011011101000001100100001 |
3 | 111021000020021211221002110001 |
4 | 112333120011123220030201 |
5 | 101223110302032223131 |
6 | 555014150352540001 |
7 | 30204054565353202 |
oct | 2677300533501441 |
9 | 437006254832401 |
10 | 101112211211041 |
11 | 2a2434a2269818 |
12 | b410282b51601 |
13 | 4455ac0a66b84 |
14 | 1ad7bddd975a9 |
15 | ba5262312261 |
hex | 5bf6056e8321 |
101112211211041 has 2 divisors, whose sum is σ = 101112211211042. Its totient is φ = 101112211211040.
The previous prime is 101112211210999. The next prime is 101112211211057. The reversal of 101112211211041 is 140112112211101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99166942227600 + 1945268983441 = 9958260^2 + 1394729^2 .
It is a cyclic number.
It is not a de Polignac number, because 101112211211041 - 239 = 100562455397153 is a prime.
It is not a weakly prime, because it can be changed into another prime (101112211211941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50556105605520 + 50556105605521.
It is an arithmetic number, because the mean of its divisors is an integer number (50556105605521).
Almost surely, 2101112211211041 is an apocalyptic number.
It is an amenable number.
101112211211041 is a deficient number, since it is larger than the sum of its proper divisors (1).
101112211211041 is an equidigital number, since it uses as much as digits as its factorization.
101112211211041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 19.
Adding to 101112211211041 its reverse (140112112211101), we get a palindrome (241224323422142).
The spelling of 101112211211041 in words is "one hundred one trillion, one hundred twelve billion, two hundred eleven million, two hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •