Base | Representation |
---|---|
bin | 100111001001010… |
… | …1001111100100101 |
3 | 10101112121101110000 |
4 | 1032102221330211 |
5 | 10142224411003 |
6 | 334201051513 |
7 | 44356451463 |
oct | 11622517445 |
9 | 3345541400 |
10 | 1313513253 |
11 | 614497a48 |
12 | 307a86b99 |
13 | 17c1899a0 |
14 | c663b833 |
15 | 7a4ae1a3 |
hex | 4e4a9f25 |
1313513253 has 20 divisors (see below), whose sum is σ = 2113098988. Its totient is φ = 808315200.
The previous prime is 1313513251. The next prime is 1313513287. The reversal of 1313513253 is 3523153131.
It can be written as a sum of positive squares in 2 ways, for example, as 154927809 + 1158585444 = 12447^2 + 34038^2 .
It is not a de Polignac number, because 1313513253 - 21 = 1313513251 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1313513251) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 622648 + ... + 624753.
Almost surely, 21313513253 is an apocalyptic number.
1313513253 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1313513253 is a deficient number, since it is larger than the sum of its proper divisors (799585735).
1313513253 is a wasteful number, since it uses less digits than its factorization.
1313513253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1247426 (or 1247417 counting only the distinct ones).
The product of its digits is 4050, while the sum is 27.
The square root of 1313513253 is about 36242.4233875165. The cubic root of 1313513253 is about 1095.1614623981.
Adding to 1313513253 its reverse (3523153131), we get a palindrome (4836666384).
The spelling of 1313513253 in words is "one billion, three hundred thirteen million, five hundred thirteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •