Base | Representation |
---|---|
bin | 101000000100100000001 |
3 | 2110201010120 |
4 | 11000210001 |
5 | 314004100 |
6 | 44050453 |
7 | 14106030 |
oct | 5004401 |
9 | 2421116 |
10 | 1313025 |
11 | 81754a |
12 | 533a29 |
13 | 36c84c |
14 | 262717 |
15 | 1ae0a0 |
hex | 140901 |
1313025 has 48 divisors (see below), whose sum is σ = 2583168. Its totient is φ = 576000.
The previous prime is 1312967. The next prime is 1313041. The reversal of 1313025 is 5203131.
It is a happy number.
It is not a de Polignac number, because 1313025 - 28 = 1312769 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1312995 and 1313013.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 21495 + ... + 21555.
It is an arithmetic number, because the mean of its divisors is an integer number (53816).
21313025 is an apocalyptic number.
1313025 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1313025 is a deficient number, since it is larger than the sum of its proper divisors (1270143).
1313025 is a wasteful number, since it uses less digits than its factorization.
1313025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122 (or 117 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 1313025 is about 1145.8730296154. The cubic root of 1313025 is about 109.5025749483.
Subtracting from 1313025 its sum of digits (15), we obtain a triangular number (1313010 = T1620).
Adding to 1313025 its reverse (5203131), we get a palindrome (6516156).
The spelling of 1313025 in words is "one million, three hundred thirteen thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •