Base | Representation |
---|---|
bin | 101010110001… |
… | …000101000001 |
3 | 210002120200221 |
4 | 222301011001 |
5 | 10332223243 |
6 | 1040143041 |
7 | 164202226 |
oct | 52610501 |
9 | 23076627 |
10 | 11211073 |
11 | 6368055 |
12 | 3907a81 |
13 | 2426b93 |
14 | 16bb94d |
15 | eb6bed |
hex | ab1141 |
11211073 has 4 divisors (see below), whose sum is σ = 11268180. Its totient is φ = 11153968.
The previous prime is 11211071. The next prime is 11211077. The reversal of 11211073 is 37011211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 37011211 = 37 ⋅1000303.
It can be written as a sum of positive squares in 2 ways, for example, as 7551504 + 3659569 = 2748^2 + 1913^2 .
It is a cyclic number.
It is not a de Polignac number, because 11211073 - 21 = 11211071 is a prime.
It is a super-2 number, since 2×112110732 = 251376315622658, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11211071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28258 + ... + 28651.
It is an arithmetic number, because the mean of its divisors is an integer number (2817045).
Almost surely, 211211073 is an apocalyptic number.
It is an amenable number.
11211073 is a deficient number, since it is larger than the sum of its proper divisors (57107).
11211073 is an equidigital number, since it uses as much as digits as its factorization.
11211073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57106.
The product of its (nonzero) digits is 42, while the sum is 16.
The square root of 11211073 is about 3348.2940432405. The cubic root of 11211073 is about 223.8114977177.
Adding to 11211073 its reverse (37011211), we get a palindrome (48222284).
The spelling of 11211073 in words is "eleven million, two hundred eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •