Base | Representation |
---|---|
bin | 1111101010000000000000 |
3 | 21201111220010 |
4 | 33222000000 |
5 | 2022313232 |
6 | 223544520 |
7 | 46612401 |
oct | 17520000 |
9 | 7644803 |
10 | 4104192 |
11 | 23535a4 |
12 | 145b140 |
13 | b09121 |
14 | 78b9a8 |
15 | 5610cc |
hex | 3ea000 |
4104192 has 56 divisors (see below), whose sum is σ = 11009376. Its totient is φ = 1359872.
The previous prime is 4104187. The next prime is 4104193. The reversal of 4104192 is 2914014.
It is a nialpdrome in base 4.
It is a zygodrome in base 4.
It is not an unprimeable number, because it can be changed into a prime (4104193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24493 + ... + 24659.
It is an arithmetic number, because the mean of its divisors is an integer number (196596).
Almost surely, 24104192 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 4104192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5504688).
4104192 is an abundant number, since it is smaller than the sum of its proper divisors (6905184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4104192 is an equidigital number, since it uses as much as digits as its factorization.
4104192 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196 (or 172 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 21.
The square root of 4104192 is about 2025.8805492921. The cubic root of 4104192 is about 160.1065956345.
It can be divided in two parts, 4 and 104192, that added together give a triangular number (104196 = T456).
The spelling of 4104192 in words is "four million, one hundred four thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •