Base | Representation |
---|---|
bin | 1010001010010001100000… |
… | …10010110011111001010001 |
3 | 2221002222210010022120120202 |
4 | 11011020300102303321101 |
5 | 10412032413402030223 |
6 | 115304201015344545 |
7 | 4464150033234266 |
oct | 505106022637121 |
9 | 87088703276522 |
10 | 22343230111313 |
11 | 713478aa02641 |
12 | 260a326682155 |
13 | c60c5a9ab617 |
14 | 5735bd40326d |
15 | 28b2ea8a4428 |
hex | 1452304b3e51 |
22343230111313 has 2 divisors, whose sum is σ = 22343230111314. Its totient is φ = 22343230111312.
The previous prime is 22343230111289. The next prime is 22343230111343. The reversal of 22343230111313 is 31311103234322.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20152853791249 + 2190376320064 = 4489193^2 + 1479992^2 .
It is a cyclic number.
It is not a de Polignac number, because 22343230111313 - 224 = 22343213334097 is a prime.
It is not a weakly prime, because it can be changed into another prime (22343230111343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11171615055656 + 11171615055657.
It is an arithmetic number, because the mean of its divisors is an integer number (11171615055657).
Almost surely, 222343230111313 is an apocalyptic number.
It is an amenable number.
22343230111313 is a deficient number, since it is larger than the sum of its proper divisors (1).
22343230111313 is an equidigital number, since it uses as much as digits as its factorization.
22343230111313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 22343230111313 its reverse (31311103234322), we get a palindrome (53654333345635).
The spelling of 22343230111313 in words is "twenty-two trillion, three hundred forty-three billion, two hundred thirty million, one hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •