Base | Representation |
---|---|
bin | 1010000110011001101111… |
… | …10011110101010011010001 |
3 | 2220122021102212200200022122 |
4 | 11003030313303311103101 |
5 | 10402343003312102121 |
6 | 115123121452344025 |
7 | 4451430522646265 |
oct | 503146763652321 |
9 | 86567385620278 |
10 | 22210212222161 |
11 | 7093330864747 |
12 | 25a85a3175015 |
13 | c5154c7cab82 |
14 | 56ada11d60a5 |
15 | 287b12b165ab |
hex | 143337cf54d1 |
22210212222161 has 2 divisors, whose sum is σ = 22210212222162. Its totient is φ = 22210212222160.
The previous prime is 22210212222151. The next prime is 22210212222223. The reversal of 22210212222161 is 16122221201222.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20079943534225 + 2130268687936 = 4481065^2 + 1459544^2 .
It is a cyclic number.
It is not a de Polignac number, because 22210212222161 - 218 = 22210211960017 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22210212222161.
It is not a weakly prime, because it can be changed into another prime (22210212222151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11105106111080 + 11105106111081.
It is an arithmetic number, because the mean of its divisors is an integer number (11105106111081).
Almost surely, 222210212222161 is an apocalyptic number.
It is an amenable number.
22210212222161 is a deficient number, since it is larger than the sum of its proper divisors (1).
22210212222161 is an equidigital number, since it uses as much as digits as its factorization.
22210212222161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 22210212222161 its reverse (16122221201222), we get a palindrome (38332433423383).
The spelling of 22210212222161 in words is "twenty-two trillion, two hundred ten billion, two hundred twelve million, two hundred twenty-two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •