Base | Representation |
---|---|
bin | 101101101000… |
… | …001011111001 |
3 | 211111200112000 |
4 | 231220023321 |
5 | 11030223311 |
6 | 1104211213 |
7 | 203444646 |
oct | 55501371 |
9 | 24450460 |
10 | 11961081 |
11 | 682a5a0 |
12 | 4009b09 |
13 | 262a382 |
14 | 1834dcd |
15 | 10b4056 |
hex | b682f9 |
11961081 has 64 divisors (see below), whose sum is σ = 21565440. Its totient is φ = 6462720.
The previous prime is 11961067. The next prime is 11961083. The reversal of 11961081 is 18016911.
It is not a de Polignac number, because 11961081 - 25 = 11961049 is a prime.
It is a super-2 number, since 2×119610812 = 286134917377122, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11961083) 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 63 ways as a sum of consecutive naturals, for example, 116076 + ... + 116178.
It is an arithmetic number, because the mean of its divisors is an integer number (336960).
Almost surely, 211961081 is an apocalyptic number.
11961081 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11961081 is a deficient number, since it is larger than the sum of its proper divisors (9604359).
11961081 is a wasteful number, since it uses less digits than its factorization.
11961081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163 (or 157 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 27.
The square root of 11961081 is about 3458.4795792371. The cubic root of 11961081 is about 228.6950741548.
Adding to 11961081 its reverse (18016911), we get a palindrome (29977992).
The spelling of 11961081 in words is "eleven million, nine hundred sixty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •