Base | Representation |
---|---|
bin | 101110011000… |
… | …001001110000 |
3 | 211212200000201 |
4 | 232120021300 |
5 | 11103020202 |
6 | 1112324544 |
7 | 205223521 |
oct | 56301160 |
9 | 24780021 |
10 | 12157552 |
11 | 6954170 |
12 | 40a3754 |
13 | 2698924 |
14 | 1886848 |
15 | 1102387 |
hex | b98270 |
12157552 has 40 divisors (see below), whose sum is σ = 26105472. Its totient is φ = 5438400.
The previous prime is 12157469. The next prime is 12157553. The reversal of 12157552 is 25575121.
It is a Smith number, since the sum of its digits (28) coincides with the sum of the digits of its prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 12157552.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12157553) 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, 11277 + ... + 12307.
Almost surely, 212157552 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12157552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13052736).
12157552 is an abundant number, since it is smaller than the sum of its proper divisors (13947920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12157552 is a wasteful number, since it uses less digits than its factorization.
12157552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1117 (or 1111 counting only the distinct ones).
The product of its digits is 3500, while the sum is 28.
The square root of 12157552 is about 3486.7681310922. The cubic root of 12157552 is about 229.9404508721.
Subtracting 12157552 from its reverse (25575121), we obtain a square (13417569 = 36632).
The spelling of 12157552 in words is "twelve million, one hundred fifty-seven thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •