Base | Representation |
---|---|
bin | 10000000001100101010… |
… | …110011110110100100001 |
3 | 10220021102100200202121102 |
4 | 100001211112132310201 |
5 | 121020240234120001 |
6 | 2201520111204145 |
7 | 142363026504362 |
oct | 20014526366441 |
9 | 3807370622542 |
10 | 1101212020001 |
11 | 395026527615 |
12 | 159509816655 |
13 | 7cac7c1a882 |
14 | 3b428445b69 |
15 | 1d9a20b2e6b |
hex | 1006559ed21 |
1101212020001 has 2 divisors, whose sum is σ = 1101212020002. Its totient is φ = 1101212020000.
The previous prime is 1101212019977. The next prime is 1101212020003. The reversal of 1101212020001 is 1000202121011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1080238029025 + 20973990976 = 1039345^2 + 144824^2 .
It is a cyclic number.
It is not a de Polignac number, because 1101212020001 - 218 = 1101211757857 is a prime.
Together with 1101212020003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1101212020003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550606010000 + 550606010001.
It is an arithmetic number, because the mean of its divisors is an integer number (550606010001).
Almost surely, 21101212020001 is an apocalyptic number.
It is an amenable number.
1101212020001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101212020001 is an equidigital number, since it uses as much as digits as its factorization.
1101212020001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1101212020001 its reverse (1000202121011), we get a palindrome (2101414141012).
The spelling of 1101212020001 in words is "one trillion, one hundred one billion, two hundred twelve million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •