Base | Representation |
---|---|
bin | 101110011010… |
… | …111111000000 |
3 | 211220020221100 |
4 | 232122333000 |
5 | 11103403102 |
6 | 1112454400 |
7 | 205302402 |
oct | 56327700 |
9 | 24806840 |
10 | 12169152 |
11 | 6961956 |
12 | 40aa400 |
13 | 26a0ca8 |
14 | 188ab72 |
15 | 1105a1c |
hex | b9afc0 |
12169152 has 84 divisors (see below), whose sum is σ = 35886136. Its totient is φ = 3939840.
The previous prime is 12169133. The next prime is 12169153. The reversal of 12169152 is 25196121.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12169153) 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 11 ways as a sum of consecutive naturals, for example, 21027 + ... + 21597.
Almost surely, 212169152 is an apocalyptic number.
12169152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12169152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17943068).
12169152 is an abundant number, since it is smaller than the sum of its proper divisors (23716984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12169152 is a wasteful number, since it uses less digits than its factorization.
12169152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 626 (or 613 counting only the distinct ones).
The product of its digits is 1080, while the sum is 27.
The square root of 12169152 is about 3488.4311660114. The cubic root of 12169152 is about 230.0135593770.
It can be divided in two parts, 12169 and 152, that added together give a palindrome (12321).
The spelling of 12169152 in words is "twelve million, one hundred sixty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •