Base | Representation |
---|---|
bin | 10011001101111100100… |
… | …110001010011101101101 |
3 | 11200020211001012100010221 |
4 | 103031330212022131231 |
5 | 133114140201321424 |
6 | 2450410204531341 |
7 | 164261552110144 |
oct | 23157446123555 |
9 | 4606731170127 |
10 | 1320645338989 |
11 | 46a09a956a19 |
12 | 193b49550b51 |
13 | 976c83b3662 |
14 | 47cc345a75b |
15 | 245466679e4 |
hex | 1337c98a76d |
1320645338989 has 2 divisors, whose sum is σ = 1320645338990. Its totient is φ = 1320645338988.
The previous prime is 1320645338983. The next prime is 1320645339001. The reversal of 1320645338989 is 9898335460231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 715115466025 + 605529872964 = 845645^2 + 778158^2 .
It is a cyclic number.
It is not a de Polignac number, because 1320645338989 - 221 = 1320643241837 is a prime.
It is a super-2 number, since 2×13206453389892 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1320645338983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 660322669494 + 660322669495.
It is an arithmetic number, because the mean of its divisors is an integer number (660322669495).
Almost surely, 21320645338989 is an apocalyptic number.
It is an amenable number.
1320645338989 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320645338989 is an equidigital number, since it uses as much as digits as its factorization.
1320645338989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 33592320, while the sum is 61.
The spelling of 1320645338989 in words is "one trillion, three hundred twenty billion, six hundred forty-five million, three hundred thirty-eight thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •