Base | Representation |
---|---|
bin | 10011010010110100111… |
… | …010011010011100111101 |
3 | 11200202100012210202010201 |
4 | 103102310322122130331 |
5 | 133210403043414444 |
6 | 2453034144003501 |
7 | 164535445504243 |
oct | 23226472323475 |
9 | 4622305722121 |
10 | 1325885138749 |
11 | 471339660046 |
12 | 194b70300591 |
13 | 98051b22ba2 |
14 | 4825d300793 |
15 | 2475168add4 |
hex | 134b4e9a73d |
1325885138749 has 2 divisors, whose sum is σ = 1325885138750. Its totient is φ = 1325885138748.
The previous prime is 1325885138737. The next prime is 1325885138777. The reversal of 1325885138749 is 9478315885231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 867971722500 + 457913416249 = 931650^2 + 676693^2 .
It is an emirp because it is prime and its reverse (9478315885231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1325885138749 - 25 = 1325885138717 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1325885138729) 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, 662942569374 + 662942569375.
It is an arithmetic number, because the mean of its divisors is an integer number (662942569375).
Almost surely, 21325885138749 is an apocalyptic number.
It is an amenable number.
1325885138749 is a deficient number, since it is larger than the sum of its proper divisors (1).
1325885138749 is an equidigital number, since it uses as much as digits as its factorization.
1325885138749 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 58060800, while the sum is 64.
The spelling of 1325885138749 in words is "one trillion, three hundred twenty-five billion, eight hundred eighty-five million, one hundred thirty-eight thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •