Base | Representation |
---|---|
bin | 10001100111000000110… |
… | …001011101010111111101 |
3 | 11021200112100021102120002 |
4 | 101213000301131113331 |
5 | 124311311210013041 |
6 | 2323531011204045 |
7 | 153266621202131 |
oct | 21470061352775 |
9 | 4250470242502 |
10 | 1210120001021 |
11 | 4272332136a8 |
12 | 1766428a6625 |
13 | 8a1630cc6a9 |
14 | 427da5a73c1 |
15 | 2172839e59b |
hex | 119c0c5d5fd |
1210120001021 has 2 divisors, whose sum is σ = 1210120001022. Its totient is φ = 1210120001020.
The previous prime is 1210120000993. The next prime is 1210120001023. The reversal of 1210120001021 is 1201000210121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 802348356121 + 407771644900 = 895739^2 + 638570^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1210120001021 is a prime.
Together with 1210120001023, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1210120000993 and 1210120001011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1210120001023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 605060000510 + 605060000511.
It is an arithmetic number, because the mean of its divisors is an integer number (605060000511).
Almost surely, 21210120001021 is an apocalyptic number.
It is an amenable number.
1210120001021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210120001021 is an equidigital number, since it uses as much as digits as its factorization.
1210120001021 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 1210120001021 its reverse (1201000210121), we get a palindrome (2411120211142).
The spelling of 1210120001021 in words is "one trillion, two hundred ten billion, one hundred twenty million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.185 sec. • engine limits •