Base | Representation |
---|---|
bin | 11111110011011010100 |
3 | 1221221112111 |
4 | 3332123110 |
5 | 231322012 |
6 | 34200404 |
7 | 11600200 |
oct | 3763324 |
9 | 1857474 |
10 | 1042132 |
11 | 651a73 |
12 | 423104 |
13 | 2a6460 |
14 | 1d1b00 |
15 | 158ba7 |
hex | fe6d4 |
1042132 has 36 divisors (see below), whose sum is σ = 2290260. Its totient is φ = 411264.
The previous prime is 1042123. The next prime is 1042133. The reversal of 1042132 is 2312401.
It can be written as a sum of positive squares in 2 ways, for example, as 571536 + 470596 = 756^2 + 686^2 .
It is a Harshad number since it is a multiple of its sum of digits (13).
It is an Ulam number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1042133) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 2344 + ... + 2752.
21042132 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 1042132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1145130).
1042132 is an abundant number, since it is smaller than the sum of its proper divisors (1248128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1042132 is a wasteful number, since it uses less digits than its factorization.
1042132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440 (or 431 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 1042132 is about 1020.8486665515. The cubic root of 1042132 is about 101.3851256862.
Adding to 1042132 its reverse (2312401), we get a palindrome (3354533).
The spelling of 1042132 in words is "one million, forty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •