Base | Representation |
---|---|
bin | 100111000001… |
… | …010110011111 |
3 | 201020200202110 |
4 | 213001112133 |
5 | 10104313101 |
6 | 1003125103 |
7 | 152642412 |
oct | 47012637 |
9 | 21220673 |
10 | 10229151 |
11 | 5857349 |
12 | 3513793 |
13 | 2171c6a |
14 | 1503b79 |
15 | d70cd6 |
hex | 9c159f |
10229151 has 8 divisors (see below), whose sum is σ = 13862704. Its totient is φ = 6707520.
The previous prime is 10229119. The next prime is 10229161. The reversal of 10229151 is 15192201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10229151 - 25 = 10229119 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10229111) 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, 27766 + ... + 28131.
It is an arithmetic number, because the mean of its divisors is an integer number (1732838).
Almost surely, 210229151 is an apocalyptic number.
10229151 is a deficient number, since it is larger than the sum of its proper divisors (3633553).
10229151 is an equidigital number, since it uses as much as digits as its factorization.
10229151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55961.
The product of its (nonzero) digits is 180, while the sum is 21.
The square root of 10229151 is about 3198.3043945191. The cubic root of 10229151 is about 217.0766928617.
The spelling of 10229151 in words is "ten million, two hundred twenty-nine thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •