Base | Representation |
---|---|
bin | 10011001111100000000… |
… | …000111100010000111111 |
3 | 11200102010021202200202121 |
4 | 103033200000330100333 |
5 | 133131044201144403 |
6 | 2451243511103411 |
7 | 164351104424242 |
oct | 23174000742077 |
9 | 4612107680677 |
10 | 1322313303103 |
11 | 46a876429061 |
12 | 194334071b67 |
13 | 97902b24380 |
14 | 48000ba3259 |
15 | 245e2cde3bd |
hex | 133e003c43f |
1322313303103 has 16 divisors (see below), whose sum is σ = 1438131633120. Its totient is φ = 1208568075264.
The previous prime is 1322313303053. The next prime is 1322313303131. The reversal of 1322313303103 is 3013033132231.
It is a cyclic number.
It is not a de Polignac number, because 1322313303103 - 233 = 1313723368511 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1322313303203) 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 in 15 ways as a sum of consecutive naturals, for example, 677226 + ... + 1761607.
It is an arithmetic number, because the mean of its divisors is an integer number (89883227070).
Almost surely, 21322313303103 is an apocalyptic number.
1322313303103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1322313303103 is a deficient number, since it is larger than the sum of its proper divisors (115818330017).
1322313303103 is a wasteful number, since it uses less digits than its factorization.
1322313303103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2439258.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 1322313303103 its reverse (3013033132231), we get a palindrome (4335346435334).
The spelling of 1322313303103 in words is "one trillion, three hundred twenty-two billion, three hundred thirteen million, three hundred three thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •