Base | Representation |
---|---|
bin | 101010001111… |
… | …001000111101 |
3 | 202211112000100 |
4 | 222033020331 |
5 | 10313301221 |
6 | 1033151313 |
7 | 163053030 |
oct | 52171075 |
9 | 22745010 |
10 | 11072061 |
11 | 6282670 |
12 | 385b539 |
13 | 23a8820 |
14 | 1683017 |
15 | e8a926 |
hex | a8f23d |
11072061 has 48 divisors (see below), whose sum is σ = 21490560. Its totient is φ = 5304960.
The previous prime is 11072059. The next prime is 11072063. The reversal of 11072061 is 16027011.
11072061 = 252 + 262 + ... + 3212.
It is an interprime number because it is at equal distance from previous prime (11072059) and next prime (11072063).
It is not a de Polignac number, because 11072061 - 21 = 11072059 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11072063) 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 47 ways as a sum of consecutive naturals, for example, 8395 + ... + 9623.
It is an arithmetic number, because the mean of its divisors is an integer number (447720).
Almost surely, 211072061 is an apocalyptic number.
11072061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11072061 is a deficient number, since it is larger than the sum of its proper divisors (10418499).
11072061 is a wasteful number, since it uses less digits than its factorization.
11072061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1266 (or 1263 counting only the distinct ones).
The product of its (nonzero) digits is 84, while the sum is 18.
The square root of 11072061 is about 3327.4706610277. The cubic root of 11072061 is about 222.8825955361.
Adding to 11072061 its reverse (16027011), we get a palindrome (27099072).
The spelling of 11072061 in words is "eleven million, seventy-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •