Base | Representation |
---|---|
bin | 1001001101000100000001… |
… | …0101000001001101010101 |
3 | 1022211110112202011210121111 |
4 | 2103101000111001031111 |
5 | 2311301301140414143 |
6 | 33305023553215021 |
7 | 2063101404254203 |
oct | 223210025011525 |
9 | 38743482153544 |
10 | 10120022201173 |
11 | 3251971782215 |
12 | 11753b2b61471 |
13 | 585410b16b81 |
14 | 26db513b4073 |
15 | 1283a1d3199d |
hex | 93440541355 |
10120022201173 has 2 divisors, whose sum is σ = 10120022201174. Its totient is φ = 10120022201172.
The previous prime is 10120022201131. The next prime is 10120022201209. The reversal of 10120022201173 is 37110222002101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10113373103409 + 6649097764 = 3180153^2 + 81542^2 .
It is an emirp because it is prime and its reverse (37110222002101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10120022201173 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10120022301173) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060011100586 + 5060011100587.
It is an arithmetic number, because the mean of its divisors is an integer number (5060011100587).
Almost surely, 210120022201173 is an apocalyptic number.
It is an amenable number.
10120022201173 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120022201173 is an equidigital number, since it uses as much as digits as its factorization.
10120022201173 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 22.
Adding to 10120022201173 its reverse (37110222002101), we get a palindrome (47230244203274).
The spelling of 10120022201173 in words is "ten trillion, one hundred twenty billion, twenty-two million, two hundred one thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •