Base | Representation |
---|---|
bin | 1010000100000100111100… |
… | …00011000011110100100001 |
3 | 2220100122020021020100111011 |
4 | 11002002132003003310201 |
5 | 10400040400204024301 |
6 | 115022310255420521 |
7 | 4442602015501324 |
oct | 502023603036441 |
9 | 86318207210434 |
10 | 22130323111201 |
11 | 70624655071a8 |
12 | 2595008524741 |
13 | c46b5a64cc96 |
14 | 5671830847bb |
15 | 2859d924da51 |
hex | 14209e0c3d21 |
22130323111201 has 2 divisors, whose sum is σ = 22130323111202. Its totient is φ = 22130323111200.
The previous prime is 22130323111121. The next prime is 22130323111271. The reversal of 22130323111201 is 10211132303122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22046790550801 + 83532560400 = 4695401^2 + 289020^2 .
It is a cyclic number.
It is not a de Polignac number, because 22130323111201 - 219 = 22130322586913 is a prime.
It is not a weakly prime, because it can be changed into another prime (22130323111271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11065161555600 + 11065161555601.
It is an arithmetic number, because the mean of its divisors is an integer number (11065161555601).
Almost surely, 222130323111201 is an apocalyptic number.
It is an amenable number.
22130323111201 is a deficient number, since it is larger than the sum of its proper divisors (1).
22130323111201 is an equidigital number, since it uses as much as digits as its factorization.
22130323111201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 22130323111201 its reverse (10211132303122), we get a palindrome (32341455414323).
The spelling of 22130323111201 in words is "twenty-two trillion, one hundred thirty billion, three hundred twenty-three million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •