Base | Representation |
---|---|
bin | 1001001101000100010110… |
… | …1000001011111111101101 |
3 | 1022211110202221110221120111 |
4 | 2103101011220023333231 |
5 | 2311301441421042143 |
6 | 33305040451020021 |
7 | 2063103534063016 |
oct | 223210550137755 |
9 | 38743687427514 |
10 | 10120111112173 |
11 | 3251a0798a387 |
12 | 117541889a611 |
13 | 58542637722a |
14 | 26db5d11a00d |
15 | 1283a9a4599d |
hex | 93445a0bfed |
10120111112173 has 2 divisors, whose sum is σ = 10120111112174. Its totient is φ = 10120111112172.
The previous prime is 10120111112147. The next prime is 10120111112197. The reversal of 10120111112173 is 37121111102101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7722190727689 + 2397920384484 = 2778883^2 + 1548522^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120111112173 - 25 = 10120111112141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10120111112123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060055556086 + 5060055556087.
It is an arithmetic number, because the mean of its divisors is an integer number (5060055556087).
Almost surely, 210120111112173 is an apocalyptic number.
It is an amenable number.
10120111112173 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120111112173 is an equidigital number, since it uses as much as digits as its factorization.
10120111112173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 22.
Adding to 10120111112173 its reverse (37121111102101), we get a palindrome (47241222214274).
The spelling of 10120111112173 in words is "ten trillion, one hundred twenty billion, one hundred eleven million, one hundred twelve thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •