Base | Representation |
---|---|
bin | 101110011000… |
… | …111111101101 |
3 | 211212211202121 |
4 | 232120333231 |
5 | 11103123010 |
6 | 1112352541 |
7 | 205236553 |
oct | 56307755 |
9 | 24784677 |
10 | 12161005 |
11 | 695681a |
12 | 40a5751 |
13 | 269a37c |
14 | 1887bd3 |
15 | 11033da |
hex | b98fed |
12161005 has 8 divisors (see below), whose sum is σ = 15096600. Its totient is φ = 9393216.
The previous prime is 12161003. The next prime is 12161011. The reversal of 12161005 is 50016121.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 175561 + 11985444 = 419^2 + 3462^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12161005 - 21 = 12161003 is a prime.
It is a super-2 number, since 2×121610052 = 295780085220050, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12161005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12161003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41790 + ... + 42079.
It is an arithmetic number, because the mean of its divisors is an integer number (1887075).
Almost surely, 212161005 is an apocalyptic number.
It is an amenable number.
12161005 is a deficient number, since it is larger than the sum of its proper divisors (2935595).
12161005 is an equidigital number, since it uses as much as digits as its factorization.
12161005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83903.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 12161005 is about 3487.2632536131. The cubic root of 12161005 is about 229.9622181166.
Adding to 12161005 its reverse (50016121), we get a palindrome (62177126).
The spelling of 12161005 in words is "twelve million, one hundred sixty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •