Base | Representation |
---|---|
bin | 100111001010… |
… | …001000110110 |
3 | 201022112010110 |
4 | 213022020312 |
5 | 10111441032 |
6 | 1004003450 |
7 | 153152346 |
oct | 47121066 |
9 | 21275113 |
10 | 10265142 |
11 | 5881398 |
12 | 3530586 |
13 | 2185464 |
14 | 1512d26 |
15 | d7b7cc |
hex | 9ca236 |
10265142 has 8 divisors (see below), whose sum is σ = 20530296. Its totient is φ = 3421712.
The previous prime is 10265119. The next prime is 10265183. The reversal of 10265142 is 24156201.
It is a sphenic number, since it is the product of 3 distinct primes.
10265142 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 855423 + ... + 855434.
It is an arithmetic number, because the mean of its divisors is an integer number (2566287).
Almost surely, 210265142 is an apocalyptic number.
10265142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10265142 is a wasteful number, since it uses less digits than its factorization.
10265142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1710862.
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 10265142 is about 3203.9260291087. The cubic root of 10265142 is about 217.3309877382.
The spelling of 10265142 in words is "ten million, two hundred sixty-five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •