Base | Representation |
---|---|
bin | 100111011111100… |
… | …0000111111110001 |
3 | 10102100111012002101 |
4 | 1032333000333301 |
5 | 10203214021001 |
6 | 335254220401 |
7 | 44560343521 |
oct | 11677007761 |
9 | 3370435071 |
10 | 1325142001 |
11 | 62000a887 |
12 | 30b954701 |
13 | 1816cb9c1 |
14 | c7dc7681 |
15 | 7b509a01 |
hex | 4efc0ff1 |
1325142001 has 2 divisors, whose sum is σ = 1325142002. Its totient is φ = 1325142000.
The previous prime is 1325141989. The next prime is 1325142029. The reversal of 1325142001 is 1002415231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 776458225 + 548683776 = 27865^2 + 23424^2 .
It is a cyclic number.
It is not a de Polignac number, because 1325142001 - 225 = 1291587569 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1325142001.
It is not a weakly prime, because it can be changed into another prime (1325142031) 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 as a sum of consecutive naturals, namely, 662571000 + 662571001.
It is an arithmetic number, because the mean of its divisors is an integer number (662571001).
Almost surely, 21325142001 is an apocalyptic number.
It is an amenable number.
1325142001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1325142001 is an equidigital number, since it uses as much as digits as its factorization.
1325142001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 1325142001 is about 36402.4999278896. The cubic root of 1325142001 is about 1098.3838528504.
Adding to 1325142001 its reverse (1002415231), we get a palindrome (2327557232).
The spelling of 1325142001 in words is "one billion, three hundred twenty-five million, one hundred forty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •