Base | Representation |
---|---|
bin | 1010000011110010000111… |
… | …11111001011111110001101 |
3 | 2220022200011022121111122122 |
4 | 11001321003333023332031 |
5 | 10344404203341240411 |
6 | 115013520110222325 |
7 | 4442063504330465 |
oct | 501710377137615 |
9 | 86280138544578 |
10 | 22120222211981 |
11 | 7059151847103 |
12 | 25930697b49a5 |
13 | c45c0aa9593a |
14 | 5668a5778ba5 |
15 | 2855e75ae9db |
hex | 141e43fcbf8d |
22120222211981 has 2 divisors, whose sum is σ = 22120222211982. Its totient is φ = 22120222211980.
The previous prime is 22120222211963. The next prime is 22120222212013. The reversal of 22120222211981 is 18911222202122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19000968180100 + 3119254031881 = 4359010^2 + 1766141^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22120222211981 is a prime.
It is a super-2 number, since 2×221202222119812 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22120222211951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11060111105990 + 11060111105991.
It is an arithmetic number, because the mean of its divisors is an integer number (11060111105991).
Almost surely, 222120222211981 is an apocalyptic number.
It is an amenable number.
22120222211981 is a deficient number, since it is larger than the sum of its proper divisors (1).
22120222211981 is an equidigital number, since it uses as much as digits as its factorization.
22120222211981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9216, while the sum is 35.
The spelling of 22120222211981 in words is "twenty-two trillion, one hundred twenty billion, two hundred twenty-two million, two hundred eleven thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •