Base | Representation |
---|---|
bin | 100111001010101… |
… | …0111110101110101 |
3 | 10101120221120111110 |
4 | 1032111113311311 |
5 | 10142420204100 |
6 | 334224225233 |
7 | 44365506204 |
oct | 11625276565 |
9 | 3346846443 |
10 | 1314225525 |
11 | 6149340a8 |
12 | 30816b219 |
13 | 17c378c52 |
14 | c678523b |
15 | 7a5a0250 |
hex | 4e557d75 |
1314225525 has 24 divisors (see below), whose sum is σ = 2175219904. Its totient is φ = 700156800.
The previous prime is 1314225499. The next prime is 1314225529. The reversal of 1314225525 is 5255224131.
It is not a de Polignac number, because 1314225525 - 27 = 1314225397 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1314225492 and 1314225501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1314225529) 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 in 23 ways as a sum of consecutive naturals, for example, 63465 + ... + 81585.
Almost surely, 21314225525 is an apocalyptic number.
1314225525 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1314225525 is a deficient number, since it is larger than the sum of its proper divisors (860994379).
1314225525 is a wasteful number, since it uses less digits than its factorization.
1314225525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19101 (or 19096 counting only the distinct ones).
The product of its digits is 12000, while the sum is 30.
The square root of 1314225525 is about 36252.2485509520. The cubic root of 1314225525 is about 1095.3593824641.
Adding to 1314225525 its reverse (5255224131), we get a palindrome (6569449656).
The spelling of 1314225525 in words is "one billion, three hundred fourteen million, two hundred twenty-five thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •