Base | Representation |
---|---|
bin | 101000101010… |
… | …110100111101 |
3 | 202001122101120 |
4 | 220222310331 |
5 | 10212124211 |
6 | 1020301153 |
7 | 156422106 |
oct | 50526475 |
9 | 22048346 |
10 | 10661181 |
11 | 60219a3 |
12 | 36a17b9 |
13 | 22937bb |
14 | 15b73ad |
15 | e08d06 |
hex | a2ad3d |
10661181 has 8 divisors (see below), whose sum is σ = 14345760. Its totient is φ = 7042032.
The previous prime is 10661177. The next prime is 10661191. The reversal of 10661181 is 18116601.
10661181 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10661181 - 22 = 10661177 is a prime.
It is a super-2 number, since 2×106611812 = 227321560629522, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10661111) 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 7 ways as a sum of consecutive naturals, for example, 15975 + ... + 16628.
It is an arithmetic number, because the mean of its divisors is an integer number (1793220).
Almost surely, 210661181 is an apocalyptic number.
It is an amenable number.
10661181 is a deficient number, since it is larger than the sum of its proper divisors (3684579).
10661181 is a wasteful number, since it uses less digits than its factorization.
10661181 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32715.
The product of its (nonzero) digits is 288, while the sum is 24.
The square root of 10661181 is about 3265.1463979430. The cubic root of 10661181 is about 220.0907408050.
Adding to 10661181 its reverse (18116601), we get a palindrome (28777782).
The spelling of 10661181 in words is "ten million, six hundred sixty-one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •