Base | Representation |
---|---|
bin | 10000010100000111011… |
… | …011001001010111011101 |
3 | 10222011210011011202022012 |
4 | 100110013123021113131 |
5 | 121332013410133041 |
6 | 2215010432001005 |
7 | 143666114305535 |
oct | 20240733112735 |
9 | 3864704152265 |
10 | 1121111021021 |
11 | 3a2507a42602 |
12 | 161341990165 |
13 | 819496c20a4 |
14 | 3c39515a4c5 |
15 | 1e26902d3eb |
hex | 105076c95dd |
1121111021021 has 2 divisors, whose sum is σ = 1121111021022. Its totient is φ = 1121111021020.
The previous prime is 1121111020973. The next prime is 1121111021071. The reversal of 1121111021021 is 1201201111211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1116433144996 + 4677876025 = 1056614^2 + 68395^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121111021021 - 210 = 1121111019997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1121111020987 and 1121111021005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121111021071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560555510510 + 560555510511.
It is an arithmetic number, because the mean of its divisors is an integer number (560555510511).
Almost surely, 21121111021021 is an apocalyptic number.
It is an amenable number.
1121111021021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121111021021 is an equidigital number, since it uses as much as digits as its factorization.
1121111021021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1121111021021 its reverse (1201201111211), we get a palindrome (2322312132232).
The spelling of 1121111021021 in words is "one trillion, one hundred twenty-one billion, one hundred eleven million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •