Base | Representation |
---|---|
bin | 101000001111000… |
… | …0001111101111101 |
3 | 10111002100121222022 |
4 | 1100132001331331 |
5 | 10231103042121 |
6 | 341544125525 |
7 | 45312142562 |
oct | 12036017575 |
9 | 3432317868 |
10 | 1350049661 |
11 | 633082324 |
12 | 3181668a5 |
13 | 18690cb6c |
14 | cb42c869 |
15 | 7d7c9aab |
hex | 50781f7d |
1350049661 has 2 divisors, whose sum is σ = 1350049662. Its totient is φ = 1350049660.
The previous prime is 1350049639. The next prime is 1350049669. The reversal of 1350049661 is 1669400531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1282069636 + 67980025 = 35806^2 + 8245^2 .
It is an emirp because it is prime and its reverse (1669400531) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1350049661 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1350049669) 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, 675024830 + 675024831.
It is an arithmetic number, because the mean of its divisors is an integer number (675024831).
Almost surely, 21350049661 is an apocalyptic number.
It is an amenable number.
1350049661 is a deficient number, since it is larger than the sum of its proper divisors (1).
1350049661 is an equidigital number, since it uses as much as digits as its factorization.
1350049661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19440, while the sum is 35.
The square root of 1350049661 is about 36743.0219361446. The cubic root of 1350049661 is about 1105.2230014769.
The spelling of 1350049661 in words is "one billion, three hundred fifty million, forty-nine thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •