Base | Representation |
---|---|
bin | 10011001111011011000… |
… | …100011001010000100101 |
3 | 11200101220111121211101022 |
4 | 103033123010121100211 |
5 | 133130411430302323 |
6 | 2451231344340525 |
7 | 164346046204403 |
oct | 23173304312045 |
9 | 4611814554338 |
10 | 1322230322213 |
11 | 46a833601309 |
12 | 194310314745 |
13 | 978bb88c258 |
14 | 47dd3b62473 |
15 | 245da89c4c8 |
hex | 133db119425 |
1322230322213 has 2 divisors, whose sum is σ = 1322230322214. Its totient is φ = 1322230322212.
The previous prime is 1322230322207. The next prime is 1322230322339. The reversal of 1322230322213 is 3122230322231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1121635619329 + 200594702884 = 1059073^2 + 447878^2 .
It is a cyclic number.
It is not a de Polignac number, because 1322230322213 - 214 = 1322230305829 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1322230322713) 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, 661115161106 + 661115161107.
It is an arithmetic number, because the mean of its divisors is an integer number (661115161107).
Almost surely, 21322230322213 is an apocalyptic number.
It is an amenable number.
1322230322213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1322230322213 is an equidigital number, since it uses as much as digits as its factorization.
1322230322213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 1322230322213 its reverse (3122230322231), we get a palindrome (4444460644444).
The spelling of 1322230322213 in words is "one trillion, three hundred twenty-two billion, two hundred thirty million, three hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •