Base | Representation |
---|---|
bin | 1111100110110100010000 |
3 | 21200212000011 |
4 | 33212310100 |
5 | 2021404102 |
6 | 223404304 |
7 | 46526362 |
oct | 17466420 |
9 | 7625004 |
10 | 4091152 |
11 | 234481a |
12 | 1453694 |
13 | b03200 |
14 | 786d32 |
15 | 55c2d7 |
hex | 3e6d10 |
4091152 has 60 divisors (see below), whose sum is σ = 9190260. Its totient is φ = 1757184.
The previous prime is 4091083. The next prime is 4091161. The reversal of 4091152 is 2511904.
4091152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 646416 + 3444736 = 804^2 + 1856^2 .
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45924 + ... + 46012.
It is an arithmetic number, because the mean of its divisors is an integer number (153171).
Almost surely, 24091152 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 4091152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4595130).
4091152 is an abundant number, since it is smaller than the sum of its proper divisors (5099108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4091152 is a wasteful number, since it uses less digits than its factorization.
4091152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140 (or 121 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 22.
The square root of 4091152 is about 2022.6596352328. The cubic root of 4091152 is about 159.9368500788.
The spelling of 4091152 in words is "four million, ninety-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •