Base | Representation |
---|---|
bin | 101000101101100… |
… | …1111000111100101 |
3 | 10112012112210002112 |
4 | 1101123033013211 |
5 | 10244210004214 |
6 | 343320050405 |
7 | 45565416146 |
oct | 12133170745 |
9 | 3465483075 |
10 | 1366094309 |
11 | 641140968 |
12 | 321603a05 |
13 | 18a039b38 |
14 | cd607acd |
15 | 7ede8a3e |
hex | 516cf1e5 |
1366094309 has 2 divisors, whose sum is σ = 1366094310. Its totient is φ = 1366094308.
The previous prime is 1366094297. The next prime is 1366094311. The reversal of 1366094309 is 9034906631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1265794084 + 100300225 = 35578^2 + 10015^2 .
It is a cyclic number.
It is not a de Polignac number, because 1366094309 - 212 = 1366090213 is a prime.
It is a super-2 number, since 2×13660943092 = 3732427322164374962, which contains 22 as substring.
Together with 1366094311, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1366094369) 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, 683047154 + 683047155.
It is an arithmetic number, because the mean of its divisors is an integer number (683047155).
Almost surely, 21366094309 is an apocalyptic number.
It is an amenable number.
1366094309 is a deficient number, since it is larger than the sum of its proper divisors (1).
1366094309 is an equidigital number, since it uses as much as digits as its factorization.
1366094309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 104976, while the sum is 41.
The square root of 1366094309 is about 36960.7130477755. The cubic root of 1366094309 is about 1109.5841065635.
The spelling of 1366094309 in words is "one billion, three hundred sixty-six million, ninety-four thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •