Base | Representation |
---|---|
bin | 100001110001010… |
… | …0000111001001101 |
3 | 2220222011111221012 |
4 | 1003202200321031 |
5 | 4310034333401 |
6 | 304234415005 |
7 | 40036241030 |
oct | 10342407115 |
9 | 2828144835 |
10 | 1133121101 |
11 | 531687722 |
12 | 277591465 |
13 | 1509a9478 |
14 | aa6c1017 |
15 | 697298bb |
hex | 438a0e4d |
1133121101 has 8 divisors (see below), whose sum is σ = 1295902080. Its totient is φ = 970566768.
The previous prime is 1133121091. The next prime is 1133121103. The reversal of 1133121101 is 1011213311.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1133121101 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1133121103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45806 + ... + 66063.
It is an arithmetic number, because the mean of its divisors is an integer number (161987760).
Almost surely, 21133121101 is an apocalyptic number.
It is an amenable number.
1133121101 is a deficient number, since it is larger than the sum of its proper divisors (162780979).
1133121101 is a wasteful number, since it uses less digits than its factorization.
1133121101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113323.
The product of its (nonzero) digits is 18, while the sum is 14.
The square root of 1133121101 is about 33661.8641937728. The cubic root of 1133121101 is about 1042.5385167504.
Adding to 1133121101 its reverse (1011213311), we get a palindrome (2144334412).
The spelling of 1133121101 in words is "one billion, one hundred thirty-three million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •