Base | Representation |
---|---|
bin | 1111101010011101000100 |
3 | 21201121110000 |
4 | 33222131010 |
5 | 2022343202 |
6 | 224001300 |
7 | 46620666 |
oct | 17523504 |
9 | 7647400 |
10 | 4106052 |
11 | 2354a35 |
12 | 1460230 |
13 | b09c22 |
14 | 78c536 |
15 | 56191c |
hex | 3ea744 |
4106052 has 120 divisors (see below), whose sum is σ = 12196800. Its totient is φ = 1197504.
The previous prime is 4106041. The next prime is 4106057. The reversal of 4106052 is 2506014.
Added to its reverse (2506014) it gives a triangular number (6612066 = T3636).
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4106057) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 141574 + ... + 141602.
It is an arithmetic number, because the mean of its divisors is an integer number (101640).
Almost surely, 24106052 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 4106052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6098400).
4106052 is an abundant number, since it is smaller than the sum of its proper divisors (8090748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4106052 is a wasteful number, since it uses less digits than its factorization.
4106052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87 (or 76 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 4106052 is about 2026.3395569351. The cubic root of 4106052 is about 160.1307784937.
Adding to 4106052 its reverse (2506014), we get a triangular number (6612066 = T3636).
The spelling of 4106052 in words is "four million, one hundred six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •