Base | Representation |
---|---|
bin | 11101001000100010111… |
… | …00101101111110111101 |
3 | 10112200210210221221110002 |
4 | 32210101130231332331 |
5 | 112400042122333041 |
6 | 2043510131124045 |
7 | 132215132431544 |
oct | 16442134557675 |
9 | 3480723857402 |
10 | 1001020121021 |
11 | 356591841a18 |
12 | 142007743625 |
13 | 7351b72c24b |
14 | 36641b1115b |
15 | 1b08b0be59b |
hex | e91172dfbd |
1001020121021 has 2 divisors, whose sum is σ = 1001020121022. Its totient is φ = 1001020121020.
The previous prime is 1001020120957. The next prime is 1001020121029. The reversal of 1001020121021 is 1201210201001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 833505091225 + 167515029796 = 912965^2 + 409286^2 .
It is a cyclic number.
It is not a de Polignac number, because 1001020121021 - 26 = 1001020120957 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 = 1001020120993 and 1001020121011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1001020121029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500510060510 + 500510060511.
It is an arithmetic number, because the mean of its divisors is an integer number (500510060511).
Almost surely, 21001020121021 is an apocalyptic number.
It is an amenable number.
1001020121021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001020121021 is an equidigital number, since it uses as much as digits as its factorization.
1001020121021 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 11.
Adding to 1001020121021 its reverse (1201210201001), we get a palindrome (2202230322022).
The spelling of 1001020121021 in words is "one trillion, one billion, twenty million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •