Base | Representation |
---|---|
bin | 100111001000011… |
… | …0110111101000001 |
3 | 10101111201110100010 |
4 | 1032100312331001 |
5 | 10142114322431 |
6 | 334143015133 |
7 | 44352450330 |
oct | 11620667501 |
9 | 3344643303 |
10 | 1313042241 |
11 | 6141a6085 |
12 | 30789a4a9 |
13 | 17c053494 |
14 | c6557d17 |
15 | 7a419846 |
hex | 4e436f41 |
1313042241 has 8 divisors (see below), whose sum is σ = 2000826304. Its totient is φ = 750309840.
The previous prime is 1313042219. The next prime is 1313042257. The reversal of 1313042241 is 1422403131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1313042241 - 211 = 1313040193 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 62525821 = 1313042241 / (1 + 3 + 1 + 3 + 0 + 4 + 2 + 2 + 4 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1313042201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31262890 + ... + 31262931.
It is an arithmetic number, because the mean of its divisors is an integer number (250103288).
Almost surely, 21313042241 is an apocalyptic number.
It is an amenable number.
1313042241 is a deficient number, since it is larger than the sum of its proper divisors (687784063).
1313042241 is an equidigital number, since it uses as much as digits as its factorization.
1313042241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62525831.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 1313042241 is about 36235.9247294725. The cubic root of 1313042241 is about 1095.0305422977.
Adding to 1313042241 its reverse (1422403131), we get a palindrome (2735445372).
The spelling of 1313042241 in words is "one billion, three hundred thirteen million, forty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •