Base | Representation |
---|---|
bin | 1100010110001110000… |
… | …1011111011000101001 |
3 | 202021112020002001101001 |
4 | 3011203201133120221 |
5 | 11433412004334233 |
6 | 241240434355001 |
7 | 21216415531444 |
oct | 3054341373051 |
9 | 667466061331 |
10 | 212123121193 |
11 | 81a62a76625 |
12 | 3513b72ba61 |
13 | 17006b31479 |
14 | a3a41cc65b |
15 | 57b791527d |
hex | 316385f629 |
212123121193 has 2 divisors, whose sum is σ = 212123121194. Its totient is φ = 212123121192.
The previous prime is 212123121191. The next prime is 212123121211. The reversal of 212123121193 is 391121321212.
212123121193 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., 210046222864 + 2076898329 = 458308^2 + 45573^2 .
It is a cyclic number.
It is not a de Polignac number, because 212123121193 - 21 = 212123121191 is a prime.
Together with 212123121191, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (212123121191) 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, 106061560596 + 106061560597.
It is an arithmetic number, because the mean of its divisors is an integer number (106061560597).
Almost surely, 2212123121193 is an apocalyptic number.
It is an amenable number.
212123121193 is a deficient number, since it is larger than the sum of its proper divisors (1).
212123121193 is an equidigital number, since it uses as much as digits as its factorization.
212123121193 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1296, while the sum is 28.
The spelling of 212123121193 in words is "two hundred twelve billion, one hundred twenty-three million, one hundred twenty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •