Base | Representation |
---|---|
bin | 10001110010011000000… |
… | …101100011000010011011 |
3 | 11022212000202001121020021 |
4 | 101302120011203002123 |
5 | 130011304002200011 |
6 | 2333305505011311 |
7 | 154211200102006 |
oct | 21623005430233 |
9 | 4285022047207 |
10 | 1222322303131 |
11 | 43142508a8a6 |
12 | 178a89323b37 |
13 | 8b3591462b7 |
14 | 4323700653d |
15 | 21bde781471 |
hex | 11c9816309b |
1222322303131 has 2 divisors, whose sum is σ = 1222322303132. Its totient is φ = 1222322303130.
The previous prime is 1222322303087. The next prime is 1222322303203. The reversal of 1222322303131 is 1313032232221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1222322303131 - 231 = 1220174819483 is a prime.
It is a super-2 number, since 2×12223223031312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1222322303096 and 1222322303105.
It is not a weakly prime, because it can be changed into another prime (1222322363131) 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, 611161151565 + 611161151566.
It is an arithmetic number, because the mean of its divisors is an integer number (611161151566).
Almost surely, 21222322303131 is an apocalyptic number.
1222322303131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1222322303131 is an equidigital number, since it uses as much as digits as its factorization.
1222322303131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1222322303131 its reverse (1313032232221), we get a palindrome (2535354535352).
The spelling of 1222322303131 in words is "one trillion, two hundred twenty-two billion, three hundred twenty-two million, three hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •