Base | Representation |
---|---|
bin | 101000101101011… |
… | …1011110010011001 |
3 | 10112012101202110221 |
4 | 1101122323302121 |
5 | 10244144441004 |
6 | 343314240041 |
7 | 45564636253 |
oct | 12132736231 |
9 | 3465352427 |
10 | 1366015129 |
11 | 641097426 |
12 | 321586021 |
13 | 18a00ca9b |
14 | cd5c6cd3 |
15 | 7edd0354 |
hex | 516bbc99 |
1366015129 has 2 divisors, whose sum is σ = 1366015130. Its totient is φ = 1366015128.
The previous prime is 1366015073. The next prime is 1366015199. The reversal of 1366015129 is 9215106631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 694427904 + 671587225 = 26352^2 + 25915^2 .
It is a cyclic number.
It is not a de Polignac number, because 1366015129 - 213 = 1366006937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1366015094 and 1366015103.
It is not a weakly prime, because it can be changed into another prime (1366015199) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 683007564 + 683007565.
It is an arithmetic number, because the mean of its divisors is an integer number (683007565).
Almost surely, 21366015129 is an apocalyptic number.
It is an amenable number.
1366015129 is a deficient number, since it is larger than the sum of its proper divisors (1).
1366015129 is an equidigital number, since it uses as much as digits as its factorization.
1366015129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 34.
The square root of 1366015129 is about 36959.6418949102. The cubic root of 1366015129 is about 1109.5626686666.
The spelling of 1366015129 in words is "one billion, three hundred sixty-six million, fifteen thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •