Base | Representation |
---|---|
bin | 101010001010… |
… | …001111100001 |
3 | 202210111111101 |
4 | 222022033201 |
5 | 10312131001 |
6 | 1032514401 |
7 | 162640402 |
oct | 52121741 |
9 | 22714441 |
10 | 11052001 |
11 | 6269594 |
12 | 384ba01 |
13 | 239c65c |
14 | 16799a9 |
15 | e84a01 |
hex | a8a3e1 |
11052001 has 4 divisors (see below), whose sum is σ = 11321604. Its totient is φ = 10782400.
The previous prime is 11051993. The next prime is 11052017. The reversal of 11052001 is 10025011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 456976 + 10595025 = 676^2 + 3255^2 .
It is a cyclic number.
It is not a de Polignac number, because 11052001 - 23 = 11051993 is a prime.
It is a super-2 number, since 2×110520012 = 244293452208002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11052061) 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, 134740 + ... + 134821.
It is an arithmetic number, because the mean of its divisors is an integer number (2830401).
Almost surely, 211052001 is an apocalyptic number.
It is an amenable number.
11052001 is a deficient number, since it is larger than the sum of its proper divisors (269603).
11052001 is an equidigital number, since it uses as much as digits as its factorization.
11052001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269602.
The product of its (nonzero) digits is 10, while the sum is 10.
The square root of 11052001 is about 3324.4549929274. The cubic root of 11052001 is about 222.7479103515.
Adding to 11052001 its reverse (10025011), we get a palindrome (21077012).
The spelling of 11052001 in words is "eleven million, fifty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •