Base | Representation |
---|---|
bin | 1011001101001111011010… |
… | …0100101010001110101111 |
3 | 1121121222111112201101110211 |
4 | 2303103312210222032233 |
5 | 3103341131332311343 |
6 | 42112410155243251 |
7 | 2411146125304036 |
oct | 263236644521657 |
9 | 47558445641424 |
10 | 12322103010223 |
11 | 3a20857a048a6 |
12 | 1470133449527 |
13 | 6b4c7a7c9166 |
14 | 30857043771d |
15 | 1657d5ca979d |
hex | b34f692a3af |
12322103010223 has 2 divisors, whose sum is σ = 12322103010224. Its totient is φ = 12322103010222.
The previous prime is 12322103010221. The next prime is 12322103010323. The reversal of 12322103010223 is 32201030122321.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12322103010223 - 21 = 12322103010221 is a prime.
It is a super-4 number, since 4×123221030102234 (a number of 53 digits) contains 4444 as substring.
Together with 12322103010221, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 12322103010194 and 12322103010203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12322103010221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6161051505111 + 6161051505112.
It is an arithmetic number, because the mean of its divisors is an integer number (6161051505112).
Almost surely, 212322103010223 is an apocalyptic number.
12322103010223 is a deficient number, since it is larger than the sum of its proper divisors (1).
12322103010223 is an equidigital number, since it uses as much as digits as its factorization.
12322103010223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 12322103010223 its reverse (32201030122321), we get a palindrome (44523133132544).
The spelling of 12322103010223 in words is "twelve trillion, three hundred twenty-two billion, one hundred three million, ten thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •