Base | Representation |
---|---|
bin | 100111000101000… |
… | …0010010000010101 |
3 | 10101101100120200101 |
4 | 1032022002100111 |
5 | 10141140103100 |
6 | 334040414101 |
7 | 44331320401 |
oct | 11612022025 |
9 | 3341316611 |
10 | 1311253525 |
11 | 6131941aa |
12 | 307177331 |
13 | 17b87827a |
14 | c6210101 |
15 | 7a1b486a |
hex | 4e282415 |
1311253525 has 12 divisors (see below), whose sum is σ = 1630325092. Its totient is φ = 1046183040.
The previous prime is 1311253523. The next prime is 1311253547. The reversal of 1311253525 is 5253521131.
It can be written as a sum of positive squares in 6 ways, for example, as 31832164 + 1279421361 = 5642^2 + 35769^2 .
It is not a de Polignac number, because 1311253525 - 21 = 1311253523 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1311253493 and 1311253502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311253523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 60984 + ... + 79633.
Almost surely, 21311253525 is an apocalyptic number.
It is an amenable number.
1311253525 is a deficient number, since it is larger than the sum of its proper divisors (319071567).
1311253525 is a wasteful number, since it uses less digits than its factorization.
1311253525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141000 (or 140995 counting only the distinct ones).
The product of its digits is 4500, while the sum is 28.
The square root of 1311253525 is about 36211.2347897721. The cubic root of 1311253525 is about 1094.5330744863.
Adding to 1311253525 its reverse (5253521131), we get a palindrome (6564774656).
The spelling of 1311253525 in words is "one billion, three hundred eleven million, two hundred fifty-three thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •