Base | Representation |
---|---|
bin | 1011000000010100110011… |
… | …0001111100010001010101 |
3 | 1120211202202111211001010121 |
4 | 2300011030301330101111 |
5 | 3041222213011030143 |
6 | 41422432112151541 |
7 | 2356132336520044 |
oct | 260051461742125 |
9 | 46752674731117 |
10 | 12100211033173 |
11 | 394574174928a |
12 | 14351282385b1 |
13 | 69a077b4a513 |
14 | 2db920a9455b |
15 | 15eb4a9437ed |
hex | b014cc7c455 |
12100211033173 has 2 divisors, whose sum is σ = 12100211033174. Its totient is φ = 12100211033172.
The previous prime is 12100211033153. The next prime is 12100211033227. The reversal of 12100211033173 is 37133011200121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9624743050129 + 2475467983044 = 3102377^2 + 1573362^2 .
It is a cyclic number.
It is not a de Polignac number, because 12100211033173 - 29 = 12100211032661 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12100211033153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6050105516586 + 6050105516587.
It is an arithmetic number, because the mean of its divisors is an integer number (6050105516587).
Almost surely, 212100211033173 is an apocalyptic number.
It is an amenable number.
12100211033173 is a deficient number, since it is larger than the sum of its proper divisors (1).
12100211033173 is an equidigital number, since it uses as much as digits as its factorization.
12100211033173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 25.
Adding to 12100211033173 its reverse (37133011200121), we get a palindrome (49233222233294).
The spelling of 12100211033173 in words is "twelve trillion, one hundred billion, two hundred eleven million, thirty-three thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •