Base | Representation |
---|---|
bin | 10000000001011010000… |
… | …010000100100100001001 |
3 | 10220020221010100212001111 |
4 | 100001122002010210021 |
5 | 121014343130321301 |
6 | 2201445205050321 |
7 | 142355232414553 |
oct | 20013202044411 |
9 | 3806833325044 |
10 | 1101022120201 |
11 | 394a39313033 |
12 | 1594760b69a1 |
13 | 7ca9778b923 |
14 | 3b40b1324d3 |
15 | 1d9905a1551 |
hex | 1005a084909 |
1101022120201 has 2 divisors, whose sum is σ = 1101022120202. Its totient is φ = 1101022120200.
The previous prime is 1101022120193. The next prime is 1101022120213. The reversal of 1101022120201 is 1020212201011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1015360537801 + 85661582400 = 1007651^2 + 292680^2 .
It is an emirp because it is prime and its reverse (1020212201011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101022120201 - 23 = 1101022120193 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101022150201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550511060100 + 550511060101.
It is an arithmetic number, because the mean of its divisors is an integer number (550511060101).
Almost surely, 21101022120201 is an apocalyptic number.
It is an amenable number.
1101022120201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101022120201 is an equidigital number, since it uses as much as digits as its factorization.
1101022120201 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 13.
Adding to 1101022120201 its reverse (1020212201011), we get a palindrome (2121234321212).
The spelling of 1101022120201 in words is "one trillion, one hundred one billion, twenty-two million, one hundred twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •