Base | Representation |
---|---|
bin | 1010001001101010101111… |
… | …00000001110010001111001 |
3 | 2221001000001100102221112021 |
4 | 11010311113200032101321 |
5 | 10411212300223232301 |
6 | 115250435222514441 |
7 | 4462512130462522 |
oct | 504652740162171 |
9 | 87030040387467 |
10 | 22322413102201 |
11 | 7126978285583 |
12 | 2606296b95a21 |
13 | c5bcc0c76b54 |
14 | 5725a6805849 |
15 | 28a9cd0518a1 |
hex | 144d5780e479 |
22322413102201 has 2 divisors, whose sum is σ = 22322413102202. Its totient is φ = 22322413102200.
The previous prime is 22322413102189. The next prime is 22322413102243. The reversal of 22322413102201 is 10220131422322.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15218589012201 + 7103824090000 = 3901101^2 + 2665300^2 .
It is a cyclic number.
It is not a de Polignac number, because 22322413102201 - 217 = 22322412971129 is a prime.
It is a super-3 number, since 3×223224131022013 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (22322413142201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11161206551100 + 11161206551101.
It is an arithmetic number, because the mean of its divisors is an integer number (11161206551101).
Almost surely, 222322413102201 is an apocalyptic number.
It is an amenable number.
22322413102201 is a deficient number, since it is larger than the sum of its proper divisors (1).
22322413102201 is an equidigital number, since it uses as much as digits as its factorization.
22322413102201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 22322413102201 its reverse (10220131422322), we get a palindrome (32542544524523).
The spelling of 22322413102201 in words is "twenty-two trillion, three hundred twenty-two billion, four hundred thirteen million, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •