Base | Representation |
---|---|
bin | 1001001101000011111100… |
… | …1000000010101010000101 |
3 | 1022211110111100012121000111 |
4 | 2103100333020002222011 |
5 | 2311301231004201041 |
6 | 33305021552513021 |
7 | 2063101040610643 |
oct | 223207710025205 |
9 | 38743440177014 |
10 | 10120002022021 |
11 | 325196134a331 |
12 | 11753a824b771 |
13 | 5854098a0048 |
14 | 26db4c840193 |
15 | 1283a0197981 |
hex | 9343f202a85 |
10120002022021 has 2 divisors, whose sum is σ = 10120002022022. Its totient is φ = 10120002022020.
The previous prime is 10120002021977. The next prime is 10120002022069. The reversal of 10120002022021 is 12022020002101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6855421577796 + 3264580444225 = 2618286^2 + 1806815^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120002022021 - 221 = 10119999924869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10120002021992 and 10120002022010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10120042022021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060001011010 + 5060001011011.
It is an arithmetic number, because the mean of its divisors is an integer number (5060001011011).
Almost surely, 210120002022021 is an apocalyptic number.
It is an amenable number.
10120002022021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120002022021 is an equidigital number, since it uses as much as digits as its factorization.
10120002022021 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 13.
Adding to 10120002022021 its reverse (12022020002101), we get a palindrome (22142022024122).
The spelling of 10120002022021 in words is "ten trillion, one hundred twenty billion, two million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •