Base | Representation |
---|---|
bin | 101010110001… |
… | …000100111010 |
3 | 210002120200200 |
4 | 222301010322 |
5 | 10332223231 |
6 | 1040143030 |
7 | 164202216 |
oct | 52610472 |
9 | 23076620 |
10 | 11211066 |
11 | 6368049 |
12 | 3907a76 |
13 | 2426b89 |
14 | 16bb946 |
15 | eb6be6 |
hex | ab113a |
11211066 has 24 divisors (see below), whose sum is σ = 24544884. Its totient is φ = 3697920.
The previous prime is 11211061. The next prime is 11211071. The reversal of 11211066 is 66011211.
It is an interprime number because it is at equal distance from previous prime (11211061) and next prime (11211071).
It can be written as a sum of positive squares in 2 ways, for example, as 10989225 + 221841 = 3315^2 + 471^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (11211061) 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 11 ways as a sum of consecutive naturals, for example, 1465 + ... + 4956.
Almost surely, 211211066 is an apocalyptic number.
11211066 is an abundant number, since it is smaller than the sum of its proper divisors (13333818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11211066 is a wasteful number, since it uses less digits than its factorization.
11211066 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6526 (or 6523 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
The square root of 11211066 is about 3348.2929979319. The cubic root of 11211066 is about 223.8114511363.
Adding to 11211066 its reverse (66011211), we get a palindrome (77222277).
It can be divided in two parts, 1121 and 1066, that added together give a 7-th power (2187 = 37).
The spelling of 11211066 in words is "eleven million, two hundred eleven thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •