Base | Representation |
---|---|
bin | 100001100011111… |
… | …1110011001110101 |
3 | 2220111002001200221 |
4 | 1003013332121311 |
5 | 4301244222320 |
6 | 303425334341 |
7 | 36623144134 |
oct | 10307763165 |
9 | 2814061627 |
10 | 1126164085 |
11 | 528765822 |
12 | 2751973b1 |
13 | 14c4119a7 |
14 | a97cd91b |
15 | 68d033aa |
hex | 431fe675 |
1126164085 has 4 divisors (see below), whose sum is σ = 1351396908. Its totient is φ = 900931264.
The previous prime is 1126164007. The next prime is 1126164101. The reversal of 1126164085 is 5804616211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5804616211 = 251 ⋅23125961.
It can be written as a sum of positive squares in 2 ways, for example, as 817845604 + 308318481 = 28598^2 + 17559^2 .
It is a cyclic number.
It is not a de Polignac number, because 1126164085 - 27 = 1126163957 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1126164085.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 112616404 + ... + 112616413.
It is an arithmetic number, because the mean of its divisors is an integer number (337849227).
Almost surely, 21126164085 is an apocalyptic number.
It is an amenable number.
1126164085 is a deficient number, since it is larger than the sum of its proper divisors (225232823).
1126164085 is an equidigital number, since it uses as much as digits as its factorization.
1126164085 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 225232822.
The product of its (nonzero) digits is 11520, while the sum is 34.
The square root of 1126164085 is about 33558.3683304180. The cubic root of 1126164085 is about 1040.4005129606.
The spelling of 1126164085 in words is "one billion, one hundred twenty-six million, one hundred sixty-four thousand, eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •