Base | Representation |
---|---|
bin | 10011001111100000101… |
… | …101110000011011111101 |
3 | 11200102011002212120000211 |
4 | 103033200231300123331 |
5 | 133131110203114013 |
6 | 2451245010552421 |
7 | 164351306324122 |
oct | 23174055603375 |
9 | 4612132776024 |
10 | 1322325051133 |
11 | 46a882022579 |
12 | 194337b98711 |
13 | 979053a8778 |
14 | 48002580749 |
15 | 245e3d6023d |
hex | 133e0b706fd |
1322325051133 has 2 divisors, whose sum is σ = 1322325051134. Its totient is φ = 1322325051132.
The previous prime is 1322325051109. The next prime is 1322325051221. The reversal of 1322325051133 is 3311505232231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 720958922649 + 601366128484 = 849093^2 + 775478^2 .
It is a cyclic number.
It is not a de Polignac number, because 1322325051133 - 25 = 1322325051101 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1322325051095 and 1322325051104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1322325054133) 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, 661162525566 + 661162525567.
It is an arithmetic number, because the mean of its divisors is an integer number (661162525567).
Almost surely, 21322325051133 is an apocalyptic number.
It is an amenable number.
1322325051133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1322325051133 is an equidigital number, since it uses as much as digits as its factorization.
1322325051133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 31.
The spelling of 1322325051133 in words is "one trillion, three hundred twenty-two billion, three hundred twenty-five million, fifty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.674 sec. • engine limits •