Base | Representation |
---|---|
bin | 101011011000… |
… | …110111010001 |
3 | 210101212020111 |
4 | 223120313101 |
5 | 10402432113 |
6 | 1043441321 |
7 | 165451306 |
oct | 53306721 |
9 | 23355214 |
10 | 11374033 |
11 | 6469530 |
12 | 3986241 |
13 | 24830c8 |
14 | 17210ad |
15 | eea13d |
hex | ad8dd1 |
11374033 has 4 divisors (see below), whose sum is σ = 12408048. Its totient is φ = 10340020.
The previous prime is 11374031. The next prime is 11374067. The reversal of 11374033 is 33047311.
It is a happy number.
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, and also an emirpimes, since its reverse is a distinct semiprime: 33047311 = 11 ⋅3004301.
It is a cyclic number.
It is not a de Polignac number, because 11374033 - 21 = 11374031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11373995 and 11374013.
It is not an unprimeable number, because it can be changed into a prime (11374031) 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 3 ways as a sum of consecutive naturals, for example, 516991 + ... + 517012.
It is an arithmetic number, because the mean of its divisors is an integer number (3102012).
Almost surely, 211374033 is an apocalyptic number.
It is an amenable number.
11374033 is a deficient number, since it is larger than the sum of its proper divisors (1034015).
11374033 is a wasteful number, since it uses less digits than its factorization.
11374033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1034014.
The product of its (nonzero) digits is 756, while the sum is 22.
The square root of 11374033 is about 3372.5410301433. The cubic root of 11374033 is about 224.8906991757.
The spelling of 11374033 in words is "eleven million, three hundred seventy-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •