Base | Representation |
---|---|
bin | 100001110111011… |
… | …1000110101011001 |
3 | 2221012021022120111 |
4 | 1003232320311121 |
5 | 4311402134024 |
6 | 304432124321 |
7 | 40105641112 |
oct | 10356706531 |
9 | 2835238514 |
10 | 1136364889 |
11 | 5334a2840 |
12 | 2786966a1 |
13 | 151573a7a |
14 | aacc7209 |
15 | 69b6aa94 |
hex | 43bb8d59 |
1136364889 has 4 divisors (see below), whose sum is σ = 1239670800. Its totient is φ = 1033058980.
The previous prime is 1136364833. The next prime is 1136364917. The reversal of 1136364889 is 9884636311.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1136364889 - 221 = 1134267737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1136364389) 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 in 3 ways as a sum of consecutive naturals, for example, 51652939 + ... + 51652960.
It is an arithmetic number, because the mean of its divisors is an integer number (309917700).
Almost surely, 21136364889 is an apocalyptic number.
It is an amenable number.
1136364889 is a deficient number, since it is larger than the sum of its proper divisors (103305911).
1136364889 is a wasteful number, since it uses less digits than its factorization.
1136364889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103305910.
The product of its digits is 746496, while the sum is 49.
The square root of 1136364889 is about 33710.0117027568. The cubic root of 1136364889 is about 1043.5323946469.
It can be divided in two parts, 1136 and 364889, that added together give a square (366025 = 6052).
The spelling of 1136364889 in words is "one billion, one hundred thirty-six million, three hundred sixty-four thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •