Base | Representation |
---|---|
bin | 1111110000111011011000 |
3 | 21202221211002 |
4 | 33300323120 |
5 | 2024220233 |
6 | 224324132 |
7 | 50061206 |
oct | 17607330 |
9 | 7687732 |
10 | 4132568 |
11 | 2372950 |
12 | 1473648 |
13 | b1900b |
14 | 798076 |
15 | 5696e8 |
hex | 3f0ed8 |
4132568 has 32 divisors (see below), whose sum is σ = 8536320. Its totient is φ = 1860000.
The previous prime is 4132559. The next prime is 4132577. The reversal of 4132568 is 8652314.
It is an interprime number because it is at equal distance from previous prime (4132559) and next prime (4132577).
It is a self number, because there is not a number n which added to its sum of digits gives 4132568.
It is a congruent number.
It is an unprimeable number.
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, 13133 + ... + 13443.
It is an arithmetic number, because the mean of its divisors is an integer number (266760).
Almost surely, 24132568 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 4132568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4268160).
4132568 is an abundant number, since it is smaller than the sum of its proper divisors (4403752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4132568 is a wasteful number, since it uses less digits than its factorization.
4132568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479 (or 475 counting only the distinct ones).
The product of its digits is 5760, while the sum is 29.
The square root of 4132568 is about 2032.8718602017. The cubic root of 4132568 is about 160.4747358519.
The spelling of 4132568 in words is "four million, one hundred thirty-two thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •