Base | Representation |
---|---|
bin | 110000000001101011111010… |
… | …010111101101011001110101 |
3 | 1000200212122011110202121121022 |
4 | 300001223322113231121311 |
5 | 210141130331130430343 |
6 | 2025122032202030525 |
7 | 62330202412206602 |
oct | 6001537227553165 |
9 | 1020778143677538 |
10 | 211222102201973 |
11 | 61335877164985 |
12 | 1b8343127a8445 |
13 | 90b220aa88c05 |
14 | 3a232c08236a9 |
15 | 1964589288568 |
hex | c01afa5ed675 |
211222102201973 has 2 divisors, whose sum is σ = 211222102201974. Its totient is φ = 211222102201972.
The previous prime is 211222102201867. The next prime is 211222102201991. The reversal of 211222102201973 is 379102201222112.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 184066935034129 + 27155167167844 = 13567127^2 + 5211062^2 .
It is a cyclic number.
It is not a de Polignac number, because 211222102201973 - 212 = 211222102197877 is a prime.
It is a super-2 number, since 2×2112221022019732 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211222102201673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105611051100986 + 105611051100987.
It is an arithmetic number, because the mean of its divisors is an integer number (105611051100987).
Almost surely, 2211222102201973 is an apocalyptic number.
It is an amenable number.
211222102201973 is a deficient number, since it is larger than the sum of its proper divisors (1).
211222102201973 is an equidigital number, since it uses as much as digits as its factorization.
211222102201973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12096, while the sum is 35.
The spelling of 211222102201973 in words is "two hundred eleven trillion, two hundred twenty-two billion, one hundred two million, two hundred one thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •