Base | Representation |
---|---|
bin | 100110110100… |
… | …101011111000 |
3 | 201011001121000 |
4 | 212310223320 |
5 | 10101133042 |
6 | 1002045000 |
7 | 152335230 |
oct | 46645370 |
9 | 21131530 |
10 | 10177272 |
11 | 5821376 |
12 | 34a9760 |
13 | 2154471 |
14 | 14cccc0 |
15 | d6074c |
hex | 9b4af8 |
10177272 has 128 divisors (see below), whose sum is σ = 33177600. Its totient is φ = 2830464.
The previous prime is 10177267. The next prime is 10177303. The reversal of 10177272 is 27277101.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 80073 + ... + 80199.
It is an arithmetic number, because the mean of its divisors is an integer number (259200).
Almost surely, 210177272 is an apocalyptic number.
10177272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10177272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16588800).
10177272 is an abundant number, since it is smaller than the sum of its proper divisors (23000328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10177272 is a wasteful number, since it uses less digits than its factorization.
10177272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202 (or 192 counting only the distinct ones).
The product of its (nonzero) digits is 1372, while the sum is 27.
The square root of 10177272 is about 3190.1836937706. The cubic root of 10177272 is about 216.7090893921.
The spelling of 10177272 in words is "ten million, one hundred seventy-seven thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •