Base | Representation |
---|---|
bin | 101101101110011010111011… |
… | …010110111101011000000111 |
3 | 222101001011200021011010102102 |
4 | 231232122323112331120013 |
5 | 202324324101113410041 |
6 | 1551413010314102315 |
7 | 60234101363446163 |
oct | 5556327326753007 |
9 | 871034607133372 |
10 | 201102102091271 |
11 | 59093a16a00657 |
12 | 1a67ab2711a99b |
13 | 8829b01707b34 |
14 | 379357235dca3 |
15 | 183b1d936c09b |
hex | b6e6bb5bd607 |
201102102091271 has 2 divisors, whose sum is σ = 201102102091272. Its totient is φ = 201102102091270.
The previous prime is 201102102091211. The next prime is 201102102091277. The reversal of 201102102091271 is 172190201201102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201102102091271 - 234 = 201084922222087 is a prime.
It is a super-2 number, since 2×2011021020912712 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201102102091277) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100551051045635 + 100551051045636.
It is an arithmetic number, because the mean of its divisors is an integer number (100551051045636).
Almost surely, 2201102102091271 is an apocalyptic number.
201102102091271 is a deficient number, since it is larger than the sum of its proper divisors (1).
201102102091271 is an equidigital number, since it uses as much as digits as its factorization.
201102102091271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 29.
Adding to 201102102091271 its reverse (172190201201102), we get a palindrome (373292303292373).
The spelling of 201102102091271 in words is "two hundred one trillion, one hundred two billion, one hundred two million, ninety-one thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •