Base | Representation |
---|---|
bin | 101000101101110… |
… | …1011010111011101 |
3 | 10112012202122210212 |
4 | 1101123223113131 |
5 | 10244222210023 |
6 | 343322342205 |
7 | 45566410400 |
oct | 12133532735 |
9 | 3465678725 |
10 | 1366210013 |
11 | 64120a893 |
12 | 32165a965 |
13 | 18a07a6bc |
14 | cd637d37 |
15 | 7ee1ce78 |
hex | 516eb5dd |
1366210013 has 12 divisors (see below), whose sum is σ = 1589898492. Its totient is φ = 1170570240.
The previous prime is 1366210003. The next prime is 1366210031. The reversal of 1366210013 is 3100126631.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 883397284 + 482812729 = 29722^2 + 21973^2 .
It is not a de Polignac number, because 1366210013 - 24 = 1366209997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1366210003) 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 11 ways as a sum of consecutive naturals, for example, 183581 + ... + 190877.
It is an arithmetic number, because the mean of its divisors is an integer number (132491541).
Almost surely, 21366210013 is an apocalyptic number.
It is an amenable number.
1366210013 is a deficient number, since it is larger than the sum of its proper divisors (223688479).
1366210013 is an equidigital number, since it uses as much as digits as its factorization.
1366210013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11132 (or 11125 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
The square root of 1366210013 is about 36962.2782441775. The cubic root of 1366210013 is about 1109.6154318032.
Adding to 1366210013 its reverse (3100126631), we get a palindrome (4466336644).
The spelling of 1366210013 in words is "one billion, three hundred sixty-six million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •