Base | Representation |
---|---|
bin | 10000000001100101010… |
… | …010100110000101110001 |
3 | 10220021102021210000002002 |
4 | 100001211102212011301 |
5 | 121020240004014301 |
6 | 2201520033303345 |
7 | 142363015032203 |
oct | 20014522460561 |
9 | 3807367700062 |
10 | 1101211001201 |
11 | 3950259a1133 |
12 | 159509404b55 |
13 | 7cac7951c2c |
14 | 3b42825c773 |
15 | 1d9a1e6116b |
hex | 100654a6171 |
1101211001201 has 2 divisors, whose sum is σ = 1101211001202. Its totient is φ = 1101211001200.
The previous prime is 1101211001173. The next prime is 1101211001207. The reversal of 1101211001201 is 1021001121011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1013396568976 + 87814432225 = 1006676^2 + 296335^2 .
It is an emirp because it is prime and its reverse (1021001121011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101211001201 is a prime.
It is a super-2 number, since 2×11012110012012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1101211001207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550605500600 + 550605500601.
It is an arithmetic number, because the mean of its divisors is an integer number (550605500601).
Almost surely, 21101211001201 is an apocalyptic number.
It is an amenable number.
1101211001201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101211001201 is an equidigital number, since it uses as much as digits as its factorization.
1101211001201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1101211001201 its reverse (1021001121011), we get a palindrome (2122212122212).
The spelling of 1101211001201 in words is "one trillion, one hundred one billion, two hundred eleven million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •