Base | Representation |
---|---|
bin | 1001001101000100011001… |
… | …0001101110101001100101 |
3 | 1022211110210200222012122012 |
4 | 2103101012101232221211 |
5 | 2311302002213031041 |
6 | 33305041520244005 |
7 | 2063104025456603 |
oct | 223210621565145 |
9 | 38743720865565 |
10 | 10120122002021 |
11 | 3251a13048059 |
12 | 1175420470605 |
13 | 5854286bab25 |
14 | 26db60752873 |
15 | 1283aa9973eb |
hex | 9344646ea65 |
10120122002021 has 2 divisors, whose sum is σ = 10120122002022. Its totient is φ = 10120122002020.
The previous prime is 10120122001799. The next prime is 10120122002077. The reversal of 10120122002021 is 12020022102101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9545195620900 + 574926381121 = 3089530^2 + 758239^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120122002021 - 210 = 10120122000997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10120122001987 and 10120122002005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10120122002821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060061001010 + 5060061001011.
It is an arithmetic number, because the mean of its divisors is an integer number (5060061001011).
Almost surely, 210120122002021 is an apocalyptic number.
It is an amenable number.
10120122002021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120122002021 is an equidigital number, since it uses as much as digits as its factorization.
10120122002021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10120122002021 its reverse (12020022102101), we get a palindrome (22140144104122).
The spelling of 10120122002021 in words is "ten trillion, one hundred twenty billion, one hundred twenty-two million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •