Base | Representation |
---|---|
bin | 100001110000010… |
… | …1101110111101101 |
3 | 2220221021120122201 |
4 | 1003200231313231 |
5 | 4304424244330 |
6 | 304220341501 |
7 | 40032236326 |
oct | 10340556755 |
9 | 2827246581 |
10 | 1132649965 |
11 | 531395757 |
12 | 2773a4891 |
13 | 150872ba5 |
14 | aa5db44d |
15 | 69684eca |
hex | 4382dded |
1132649965 has 4 divisors (see below), whose sum is σ = 1359179964. Its totient is φ = 906119968.
The previous prime is 1132649929. The next prime is 1132649977. The reversal of 1132649965 is 5699462311.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5699462311 = 12919 ⋅441169.
It can be written as a sum of positive squares in 2 ways, for example, as 876041604 + 256608361 = 29598^2 + 16019^2 .
It is a cyclic number.
It is not a de Polignac number, because 1132649965 - 213 = 1132641773 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 113264992 + ... + 113265001.
It is an arithmetic number, because the mean of its divisors is an integer number (339794991).
Almost surely, 21132649965 is an apocalyptic number.
It is an amenable number.
1132649965 is a deficient number, since it is larger than the sum of its proper divisors (226529999).
1132649965 is an equidigital number, since it uses as much as digits as its factorization.
1132649965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226529998.
The product of its digits is 349920, while the sum is 46.
The square root of 1132649965 is about 33654.8653986314. The cubic root of 1132649965 is about 1042.3940057130.
The spelling of 1132649965 in words is "one billion, one hundred thirty-two million, six hundred forty-nine thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •