Base | Representation |
---|---|
bin | 1001010010111101000110… |
… | …0111111101110100101101 |
3 | 1100012010211002001122122011 |
4 | 2110233101213331310231 |
5 | 2314431101443042143 |
6 | 33423324050121221 |
7 | 2103313646306353 |
oct | 224572147756455 |
9 | 40163732048564 |
10 | 10221244112173 |
11 | 329089491a116 |
12 | 1190b41b80211 |
13 | 591b2281cc73 |
14 | 2749d48297d3 |
15 | 12ad28483e9d |
hex | 94bd19fdd2d |
10221244112173 has 2 divisors, whose sum is σ = 10221244112174. Its totient is φ = 10221244112172.
The previous prime is 10221244112171. The next prime is 10221244112213. The reversal of 10221244112173 is 37121144212201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9950857632004 + 270386480169 = 3154498^2 + 519987^2 .
It is a cyclic number.
It is not a de Polignac number, because 10221244112173 - 21 = 10221244112171 is a prime.
Together with 10221244112171, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10221244112171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110622056086 + 5110622056087.
It is an arithmetic number, because the mean of its divisors is an integer number (5110622056087).
Almost surely, 210221244112173 is an apocalyptic number.
It is an amenable number.
10221244112173 is a deficient number, since it is larger than the sum of its proper divisors (1).
10221244112173 is an equidigital number, since it uses as much as digits as its factorization.
10221244112173 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5376, while the sum is 31.
Adding to 10221244112173 its reverse (37121144212201), we get a palindrome (47342388324374).
The spelling of 10221244112173 in words is "ten trillion, two hundred twenty-one billion, two hundred forty-four million, one hundred twelve thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •