Base | Representation |
---|---|
bin | 10011010010001001001… |
… | …010000111000101101001 |
3 | 11200200110001111111020101 |
4 | 103102021022013011221 |
5 | 133202402132244413 |
6 | 2452433242025401 |
7 | 164511323062054 |
oct | 23221112070551 |
9 | 4620401444211 |
10 | 1325151056233 |
11 | 470aa2251a84 |
12 | 1949a64a8261 |
13 | 97c65a0c534 |
14 | 481cda13a9b |
15 | 2470bed4edd |
hex | 13489287169 |
1325151056233 has 2 divisors, whose sum is σ = 1325151056234. Its totient is φ = 1325151056232.
The previous prime is 1325151056231. The next prime is 1325151056263. The reversal of 1325151056233 is 3326501515231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 984079872064 + 341071184169 = 992008^2 + 584013^2 .
It is a cyclic number.
It is not a de Polignac number, because 1325151056233 - 21 = 1325151056231 is a prime.
Together with 1325151056231, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 1325151056192 and 1325151056201.
It is not a weakly prime, because it can be changed into another prime (1325151056231) 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, 662575528116 + 662575528117.
It is an arithmetic number, because the mean of its divisors is an integer number (662575528117).
Almost surely, 21325151056233 is an apocalyptic number.
It is an amenable number.
1325151056233 is a deficient number, since it is larger than the sum of its proper divisors (1).
1325151056233 is an equidigital number, since it uses as much as digits as its factorization.
1325151056233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81000, while the sum is 37.
The spelling of 1325151056233 in words is "one trillion, three hundred twenty-five billion, one hundred fifty-one million, fifty-six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •