Base | Representation |
---|---|
bin | 1001001101000100110000… |
… | …1100001011011000111101 |
3 | 1022211111001121122111122012 |
4 | 2103101030030023120331 |
5 | 2311302203112211143 |
6 | 33305055422501005 |
7 | 2063106341643314 |
oct | 223211414133075 |
9 | 38744047574565 |
10 | 10120221210173 |
11 | 3251a64048668 |
12 | 1175449734765 |
13 | 585443115089 |
14 | 26db6d9b927b |
15 | 1283b4542418 |
hex | 9344c30b63d |
10120221210173 has 2 divisors, whose sum is σ = 10120221210174. Its totient is φ = 10120221210172.
The previous prime is 10120221210167. The next prime is 10120221210247. The reversal of 10120221210173 is 37101212202101.
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., 9773013897124 + 347207313049 = 3126182^2 + 589243^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120221210173 - 230 = 10119147468349 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10120221213173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060110605086 + 5060110605087.
It is an arithmetic number, because the mean of its divisors is an integer number (5060110605087).
Almost surely, 210120221210173 is an apocalyptic number.
It is an amenable number.
10120221210173 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120221210173 is an equidigital number, since it uses as much as digits as its factorization.
10120221210173 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 336, while the sum is 23.
Adding to 10120221210173 its reverse (37101212202101), we get a palindrome (47221433412274).
The spelling of 10120221210173 in words is "ten trillion, one hundred twenty billion, two hundred twenty-one million, two hundred ten thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •