Base | Representation |
---|---|
bin | 100000001100000101100… |
… | …010111101111100111101 |
3 | 21211110120011112011212011 |
4 | 200030011202331330331 |
5 | 242220134302211143 |
6 | 4412102422411221 |
7 | 315545311026016 |
oct | 40140542757475 |
9 | 7743504464764 |
10 | 2212001210173 |
11 | 78311701a8a7 |
12 | 2b884a890b11 |
13 | 13078b04cb31 |
14 | 790c07c600d |
15 | 3c814d60e9d |
hex | 203058bdf3d |
2212001210173 has 2 divisors, whose sum is σ = 2212001210174. Its totient is φ = 2212001210172.
The previous prime is 2212001210149. The next prime is 2212001210227. The reversal of 2212001210173 is 3710121002122.
2212001210173 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1831209781284 + 380791428889 = 1353222^2 + 617083^2 .
It is a cyclic number.
It is not a de Polignac number, because 2212001210173 - 221 = 2211999113021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2212001210123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1106000605086 + 1106000605087.
It is an arithmetic number, because the mean of its divisors is an integer number (1106000605087).
Almost surely, 22212001210173 is an apocalyptic number.
It is an amenable number.
2212001210173 is a deficient number, since it is larger than the sum of its proper divisors (1).
2212001210173 is an equidigital number, since it uses as much as digits as its factorization.
2212001210173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 2212001210173 its reverse (3710121002122), we get a palindrome (5922122212295).
The spelling of 2212001210173 in words is "two trillion, two hundred twelve billion, one million, two hundred ten thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •