Base | Representation |
---|---|
bin | 1010000110011101000110… |
… | …00010011011101000100101 |
3 | 2220122110002020210210111001 |
4 | 11003032203002123220211 |
5 | 10402410144332230201 |
6 | 115124020155113301 |
7 | 4451523226053502 |
oct | 503164302335045 |
9 | 86573066723431 |
10 | 22212011211301 |
11 | 709407429892a |
12 | 25a8a05742831 |
13 | c51778425aa2 |
14 | 56b0d20c84a9 |
15 | 287bbaa20301 |
hex | 1433a309ba25 |
22212011211301 has 2 divisors, whose sum is σ = 22212011211302. Its totient is φ = 22212011211300.
The previous prime is 22212011211167. The next prime is 22212011211307. The reversal of 22212011211301 is 10311211021222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12822236064225 + 9389775147076 = 3580815^2 + 3064274^2 .
It is a cyclic number.
It is not a de Polignac number, because 22212011211301 - 241 = 20012987955749 is a prime.
It is a super-2 number, since 2×222120112113012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22212011211307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11106005605650 + 11106005605651.
It is an arithmetic number, because the mean of its divisors is an integer number (11106005605651).
Almost surely, 222212011211301 is an apocalyptic number.
It is an amenable number.
22212011211301 is a deficient number, since it is larger than the sum of its proper divisors (1).
22212011211301 is an equidigital number, since it uses as much as digits as its factorization.
22212011211301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 22212011211301 its reverse (10311211021222), we get a palindrome (32523222232523).
The spelling of 22212011211301 in words is "twenty-two trillion, two hundred twelve billion, eleven million, two hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •