Base | Representation |
---|---|
bin | 100110010011… |
… | …111000111001 |
3 | 200220020022122 |
4 | 212103320321 |
5 | 10032333222 |
6 | 555131025 |
7 | 151235462 |
oct | 46237071 |
9 | 20806278 |
10 | 10042937 |
11 | 573a453 |
12 | 3443a75 |
13 | 2108288 |
14 | 1495d69 |
15 | d35a42 |
hex | 993e39 |
10042937 has 8 divisors (see below), whose sum is σ = 10671336. Its totient is φ = 9418752.
The previous prime is 10042931. The next prime is 10042939. The reversal of 10042937 is 73924001.
It can be written as a sum of positive squares in 4 ways, for example, as 126736 + 9916201 = 356^2 + 3149^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10042937 - 212 = 10038841 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10042931) 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 7 ways as a sum of consecutive naturals, for example, 4853 + ... + 6605.
It is an arithmetic number, because the mean of its divisors is an integer number (1333917).
Almost surely, 210042937 is an apocalyptic number.
10042937 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
10042937 is a deficient number, since it is larger than the sum of its proper divisors (628399).
10042937 is a wasteful number, since it uses less digits than its factorization.
10042937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2107.
The product of its (nonzero) digits is 1512, while the sum is 26.
The square root of 10042937 is about 3169.0593241528. The cubic root of 10042937 is about 215.7513786066.
Adding to 10042937 its reverse (73924001), we get a palindrome (83966938).
The spelling of 10042937 in words is "ten million, forty-two thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •