Base | Representation |
---|---|
bin | 100111101110… |
… | …000001101110 |
3 | 201120222202220 |
4 | 213232001232 |
5 | 10131142032 |
6 | 1011100210 |
7 | 154334046 |
oct | 47560156 |
9 | 21528686 |
10 | 10412142 |
11 | 5971884 |
12 | 35a1666 |
13 | 2207340 |
14 | 1550726 |
15 | daa12c |
hex | 9ee06e |
10412142 has 32 divisors (see below), whose sum is σ = 22619520. Its totient is φ = 3176160.
The previous prime is 10412141. The next prime is 10412147. The reversal of 10412142 is 24121401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10412141) 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 15 ways as a sum of consecutive naturals, for example, 9709 + ... + 10727.
It is an arithmetic number, because the mean of its divisors is an integer number (706860).
Almost surely, 210412142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10412142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11309760).
10412142 is an abundant number, since it is smaller than the sum of its proper divisors (12207378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10412142 is a wasteful number, since it uses less digits than its factorization.
10412142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1168.
The product of its (nonzero) digits is 64, while the sum is 15.
The square root of 10412142 is about 3226.7850873586. The cubic root of 10412142 is about 218.3634903213.
Adding to 10412142 its reverse (24121401), we get a palindrome (34533543).
It can be divided in two parts, 104 and 12142, that added together give a triangular number (12246 = T156).
The spelling of 10412142 in words is "ten million, four hundred twelve thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •