Base | Representation |
---|---|
bin | 100000110010010… |
… | …1000010000101101 |
3 | 2211200001221111011 |
4 | 1001210220100231 |
5 | 4223112334013 |
6 | 301055225221 |
7 | 36155606146 |
oct | 10144502055 |
9 | 2750057434 |
10 | 1100121133 |
11 | 514a98321 |
12 | 268518211 |
13 | 146bc3b67 |
14 | a6170acd |
15 | 668abc3d |
hex | 4192842d |
1100121133 has 4 divisors (see below), whose sum is σ = 1100268640. Its totient is φ = 1099973628.
The previous prime is 1100121107. The next prime is 1100121163. The reversal of 1100121133 is 3311210011.
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 1100121133 - 29 = 1100120621 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100121163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61935 + ... + 77692.
It is an arithmetic number, because the mean of its divisors is an integer number (275067160).
Almost surely, 21100121133 is an apocalyptic number.
It is an amenable number.
1100121133 is a deficient number, since it is larger than the sum of its proper divisors (147507).
1100121133 is an equidigital number, since it uses as much as digits as its factorization.
1100121133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147506.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1100121133 is about 33168.0740019676. The cubic root of 1100121133 is about 1032.3180059405.
Adding to 1100121133 its reverse (3311210011), we get a palindrome (4411331144).
The spelling of 1100121133 in words is "one billion, one hundred million, one hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •