Base | Representation |
---|---|
bin | 10000000000011110010… |
… | …100000011001010111001 |
3 | 10220011100022002001002101 |
4 | 100000132110003022321 |
5 | 121010320132400441 |
6 | 2201201534303401 |
7 | 142321345266013 |
oct | 20003624031271 |
9 | 3804308061071 |
10 | 1100020200121 |
11 | 3945747a8707 |
12 | 159236657b61 |
13 | 7c96802b7cb |
14 | 3b3540451b3 |
15 | 1d932641231 |
hex | 1001e5032b9 |
1100020200121 has 2 divisors, whose sum is σ = 1100020200122. Its totient is φ = 1100020200120.
The previous prime is 1100020200113. The next prime is 1100020200151. The reversal of 1100020200121 is 1210020200011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 918492224400 + 181527975721 = 958380^2 + 426061^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100020200121 - 23 = 1100020200113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1100020200098 and 1100020200107.
It is not a weakly prime, because it can be changed into another prime (1100020200151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550010100060 + 550010100061.
It is an arithmetic number, because the mean of its divisors is an integer number (550010100061).
Almost surely, 21100020200121 is an apocalyptic number.
It is an amenable number.
1100020200121 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100020200121 is an equidigital number, since it uses as much as digits as its factorization.
1100020200121 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 10.
Adding to 1100020200121 its reverse (1210020200011), we get a palindrome (2310040400132).
The spelling of 1100020200121 in words is "one trillion, one hundred billion, twenty million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •