Base | Representation |
---|---|
bin | 101010010111… |
… | …011100000011 |
3 | 202220020122020 |
4 | 222113130003 |
5 | 10320343201 |
6 | 1034012523 |
7 | 163254105 |
oct | 52273403 |
9 | 22806566 |
10 | 11106051 |
11 | 62a6160 |
12 | 3877143 |
13 | 23bb138 |
14 | 1691575 |
15 | e95a36 |
hex | a97703 |
11106051 has 16 divisors (see below), whose sum is σ = 17005440. Its totient is φ = 6376320.
The previous prime is 11106047. The next prime is 11106071. The reversal of 11106051 is 15060111.
11106051 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11106051 - 22 = 11106047 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11106051.
It is not an unprimeable number, because it can be changed into a prime (11106041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8230 + ... + 9483.
It is an arithmetic number, because the mean of its divisors is an integer number (1062840).
Almost surely, 211106051 is an apocalyptic number.
11106051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11106051 is a deficient number, since it is larger than the sum of its proper divisors (5899389).
11106051 is a wasteful number, since it uses less digits than its factorization.
11106051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17746.
The product of its (nonzero) digits is 30, while the sum is 15.
The square root of 11106051 is about 3332.5742302310. The cubic root of 11106051 is about 223.1104374995.
Adding to 11106051 its reverse (15060111), we get a palindrome (26166162).
It can be divided in two parts, 111060 and 51, that added together give a palindrome (111111).
The spelling of 11106051 in words is "eleven million, one hundred six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •