Base | Representation |
---|---|
bin | 10011101001111011110101… |
… | …00100001101011110001001 |
3 | 12200001000100020211210120121 |
4 | 21310331322210031132021 |
5 | 21131123243411243421 |
6 | 231532020042023241 |
7 | 12050465121655462 |
oct | 1164757244153611 |
9 | 180030306753517 |
10 | 43222312212361 |
11 | 12854530493377 |
12 | 4a20934aa7b21 |
13 | 1b16b00b51149 |
14 | a95d848a5d69 |
15 | 4ee4a1635d41 |
hex | 274f7a90d789 |
43222312212361 has 2 divisors, whose sum is σ = 43222312212362. Its totient is φ = 43222312212360.
The previous prime is 43222312212293. The next prime is 43222312212379. The reversal of 43222312212361 is 16321221322234.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43068506275600 + 153805936761 = 6562660^2 + 392181^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-43222312212361 is a prime.
It is a super-2 number, since 2×432223122123612 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (43222312212461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21611156106180 + 21611156106181.
It is an arithmetic number, because the mean of its divisors is an integer number (21611156106181).
Almost surely, 243222312212361 is an apocalyptic number.
It is an amenable number.
43222312212361 is a deficient number, since it is larger than the sum of its proper divisors (1).
43222312212361 is an equidigital number, since it uses as much as digits as its factorization.
43222312212361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 41472, while the sum is 34.
Adding to 43222312212361 its reverse (16321221322234), we get a palindrome (59543533534595).
The spelling of 43222312212361 in words is "forty-three trillion, two hundred twenty-two billion, three hundred twelve million, two hundred twelve thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •