Base | Representation |
---|---|
bin | 110000000000001110111000… |
… | …011100111010011011000101 |
3 | 1000200112002022221202201001102 |
4 | 300000032320130322123011 |
5 | 210133011242234200312 |
6 | 2025004112200505445 |
7 | 62320035140533145 |
oct | 6000167034723305 |
9 | 1020462287681042 |
10 | 211122212021957 |
11 | 612a74778181a5 |
12 | 1b818a9577b285 |
13 | 90a597bc4a912 |
14 | 3a1c5261cc925 |
15 | 1961b8e9e2ec2 |
hex | c003b873a6c5 |
211122212021957 has 2 divisors, whose sum is σ = 211122212021958. Its totient is φ = 211122212021956.
The previous prime is 211122212021947. The next prime is 211122212022041. The reversal of 211122212021957 is 759120212221112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 192476388499396 + 18645823522561 = 13873586^2 + 4318081^2 .
It is a cyclic number.
It is not a de Polignac number, because 211122212021957 - 216 = 211122211956421 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 211122212021957.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211122212021947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105561106010978 + 105561106010979.
It is an arithmetic number, because the mean of its divisors is an integer number (105561106010979).
Almost surely, 2211122212021957 is an apocalyptic number.
It is an amenable number.
211122212021957 is a deficient number, since it is larger than the sum of its proper divisors (1).
211122212021957 is an equidigital number, since it uses as much as digits as its factorization.
211122212021957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 38.
The spelling of 211122212021957 in words is "two hundred eleven trillion, one hundred twenty-two billion, two hundred twelve million, twenty-one thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •