Base | Representation |
---|---|
bin | 111101110001010… |
… | …100110110011111 |
3 | 2200020001120002122 |
4 | 331301110312133 |
5 | 4110300400024 |
6 | 250500213155 |
7 | 34452515165 |
oct | 7561246637 |
9 | 2606046078 |
10 | 1036340639 |
11 | 491a95074 |
12 | 24b09a1bb |
13 | 136922219 |
14 | 9b8cb235 |
15 | 60eadd5e |
hex | 3dc54d9f |
1036340639 has 2 divisors, whose sum is σ = 1036340640. Its totient is φ = 1036340638.
The previous prime is 1036340609. The next prime is 1036340663. The reversal of 1036340639 is 9360436301.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1036340639 is a prime.
It is a super-3 number, since 3×10363406393 (a number of 28 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1036340599 and 1036340608.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1036340609) 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 as a sum of consecutive naturals, namely, 518170319 + 518170320.
It is an arithmetic number, because the mean of its divisors is an integer number (518170320).
Almost surely, 21036340639 is an apocalyptic number.
1036340639 is a deficient number, since it is larger than the sum of its proper divisors (1).
1036340639 is an equidigital number, since it uses as much as digits as its factorization.
1036340639 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 35.
The square root of 1036340639 is about 32192.2450133569. The cubic root of 1036340639 is about 1011.9697009447.
The spelling of 1036340639 in words is "one billion, thirty-six million, three hundred forty thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •