Base | Representation |
---|---|
bin | 100001011011000… |
… | …0001111101000001 |
3 | 2220011020001221210 |
4 | 1002312001331001 |
5 | 4244043210113 |
6 | 303140440333 |
7 | 36535152531 |
oct | 10266017501 |
9 | 2804201853 |
10 | 1121460033 |
11 | 526042581 |
12 | 2736a90a9 |
13 | 14b455825 |
14 | a8d274c1 |
15 | 686c46c3 |
hex | 42d81f41 |
1121460033 has 8 divisors (see below), whose sum is σ = 1495435168. Its totient is φ = 747562464.
The previous prime is 1121460007. The next prime is 1121460071. The reversal of 1121460033 is 3300641211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1121460033 - 214 = 1121443649 is a prime.
It is a super-2 number, since 2×11214600332 = 2515345211232722178, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1121459991 and 1121460009.
It is not an unprimeable number, because it can be changed into a prime (1121460133) 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, 43341 + ... + 64197.
It is an arithmetic number, because the mean of its divisors is an integer number (186929396).
Almost surely, 21121460033 is an apocalyptic number.
It is an amenable number.
1121460033 is a deficient number, since it is larger than the sum of its proper divisors (373975135).
1121460033 is a wasteful number, since it uses less digits than its factorization.
1121460033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38783.
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 1121460033 is about 33488.2073721482. The cubic root of 1121460033 is about 1038.9498870865.
The spelling of 1121460033 in words is "one billion, one hundred twenty-one million, four hundred sixty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •