Base | Representation |
---|---|
bin | 10011001111100001000… |
… | …001011111001000001001 |
3 | 11200102011110121022122122 |
4 | 103033201001133020021 |
5 | 133131113014114423 |
6 | 2451245313501025 |
7 | 164351401304564 |
oct | 23174101371011 |
9 | 4612143538578 |
10 | 1322330223113 |
11 | 46a884a35339 |
12 | 194339871775 |
13 | 97906499903 |
14 | 480031294db |
15 | 245e45328c8 |
hex | 133e105f209 |
1322330223113 has 2 divisors, whose sum is σ = 1322330223114. Its totient is φ = 1322330223112.
The previous prime is 1322330223061. The next prime is 1322330223139. The reversal of 1322330223113 is 3113220332231.
It is an a-pointer prime, because the next prime (1322330223139) can be obtained adding 1322330223113 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 669988086784 + 652342136329 = 818528^2 + 807677^2 .
It is a cyclic number.
It is not a de Polignac number, because 1322330223113 - 222 = 1322326028809 is a prime.
It is not a weakly prime, because it can be changed into another prime (1322330223713) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 661165111556 + 661165111557.
It is an arithmetic number, because the mean of its divisors is an integer number (661165111557).
Almost surely, 21322330223113 is an apocalyptic number.
It is an amenable number.
1322330223113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1322330223113 is an equidigital number, since it uses as much as digits as its factorization.
1322330223113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 1322330223113 its reverse (3113220332231), we get a palindrome (4435550555344).
The spelling of 1322330223113 in words is "one trillion, three hundred twenty-two billion, three hundred thirty million, two hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •