Base | Representation |
---|---|
bin | 100111001001000… |
… | …0011010100000101 |
3 | 10101112022100101021 |
4 | 1032102003110011 |
5 | 10142204330023 |
6 | 334153431141 |
7 | 44355222235 |
oct | 11622032405 |
9 | 3345270337 |
10 | 1313355013 |
11 | 61439a073 |
12 | 307a0b4b1 |
13 | 17c132959 |
14 | c65d9cc5 |
15 | 7a47c35d |
hex | 4e483505 |
1313355013 has 4 divisors (see below), whose sum is σ = 1329979840. Its totient is φ = 1296730188.
The previous prime is 1313355011. The next prime is 1313355023. The reversal of 1313355013 is 3105533131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3105533131 = 47 ⋅66075173.
It is a cyclic number.
It is not a de Polignac number, because 1313355013 - 21 = 1313355011 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1313355011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8312295 + ... + 8312452.
It is an arithmetic number, because the mean of its divisors is an integer number (332494960).
Almost surely, 21313355013 is an apocalyptic number.
It is an amenable number.
1313355013 is a deficient number, since it is larger than the sum of its proper divisors (16624827).
1313355013 is an equidigital number, since it uses as much as digits as its factorization.
1313355013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16624826.
The product of its (nonzero) digits is 2025, while the sum is 25.
The square root of 1313355013 is about 36240.2402447887. The cubic root of 1313355013 is about 1095.1174823040.
Adding to 1313355013 its reverse (3105533131), we get a palindrome (4418888144).
The spelling of 1313355013 in words is "one billion, three hundred thirteen million, three hundred fifty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •