Base | Representation |
---|---|
bin | 101000000101111… |
… | …1111110010011001 |
3 | 10110202110110000211 |
4 | 1100023333302121 |
5 | 10223400302022 |
6 | 341254531121 |
7 | 45224022655 |
oct | 12013776231 |
9 | 3422413024 |
10 | 1345322137 |
11 | 630443485 |
12 | 316666aa1 |
13 | 185946103 |
14 | ca95ba65 |
15 | 7d193e77 |
hex | 502ffc99 |
1345322137 has 2 divisors, whose sum is σ = 1345322138. Its totient is φ = 1345322136.
The previous prime is 1345322057. The next prime is 1345322171. The reversal of 1345322137 is 7312235431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 750157321 + 595164816 = 27389^2 + 24396^2 .
It is a cyclic number.
It is not a de Polignac number, because 1345322137 - 223 = 1336933529 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1345322099 and 1345322108.
It is not a weakly prime, because it can be changed into another prime (1345322177) 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, 672661068 + 672661069.
It is an arithmetic number, because the mean of its divisors is an integer number (672661069).
Almost surely, 21345322137 is an apocalyptic number.
It is an amenable number.
1345322137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1345322137 is an equidigital number, since it uses as much as digits as its factorization.
1345322137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15120, while the sum is 31.
The square root of 1345322137 is about 36678.6332488003. The cubic root of 1345322137 is about 1103.9314245479.
Adding to 1345322137 its reverse (7312235431), we get a palindrome (8657557568).
The spelling of 1345322137 in words is "one billion, three hundred forty-five million, three hundred twenty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •