Base | Representation |
---|---|
bin | 1011000111011111000011… |
… | …0100101111000110101101 |
3 | 1121021112021101020112111221 |
4 | 2301313300310233012231 |
5 | 3100231124403012024 |
6 | 41555134254543341 |
7 | 2401045562246053 |
oct | 261676064570655 |
9 | 47245241215457 |
10 | 12223222313389 |
11 | 399292637883a |
12 | 1454b38507b51 |
13 | 6a884cb685a9 |
14 | 30386dcdc1d3 |
15 | 162e49e6a3e4 |
hex | b1df0d2f1ad |
12223222313389 has 2 divisors, whose sum is σ = 12223222313390. Its totient is φ = 12223222313388.
The previous prime is 12223222313387. The next prime is 12223222313417. The reversal of 12223222313389 is 98331322232221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6878188116900 + 5345034196489 = 2622630^2 + 2311933^2 .
It is a cyclic number.
It is not a de Polignac number, because 12223222313389 - 21 = 12223222313387 is a prime.
It is a super-4 number, since 4×122232223133894 (a number of 53 digits) contains 4444 as substring.
Together with 12223222313387, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12223222313387) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6111611156694 + 6111611156695.
It is an arithmetic number, because the mean of its divisors is an integer number (6111611156695).
Almost surely, 212223222313389 is an apocalyptic number.
It is an amenable number.
12223222313389 is a deficient number, since it is larger than the sum of its proper divisors (1).
12223222313389 is an equidigital number, since it uses as much as digits as its factorization.
12223222313389 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 373248, while the sum is 43.
The spelling of 12223222313389 in words is "twelve trillion, two hundred twenty-three billion, two hundred twenty-two million, three hundred thirteen thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •