Base | Representation |
---|---|
bin | 100110101111… |
… | …111110000000 |
3 | 201010002002110 |
4 | 212233332000 |
5 | 10100023302 |
6 | 1001415320 |
7 | 152225010 |
oct | 46577600 |
9 | 21102073 |
10 | 10157952 |
11 | 5808902 |
12 | 349a540 |
13 | 214872c |
14 | 14c5c40 |
15 | d59b6c |
hex | 9aff80 |
10157952 has 64 divisors (see below), whose sum is σ = 30844800. Its totient is φ = 2901504.
The previous prime is 10157947. The next prime is 10157977. The reversal of 10157952 is 25975101.
It is a tau number, because it is divible by the number of its divisors (64).
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 7 ways as a sum of consecutive naturals, for example, 799 + ... + 4577.
It is an arithmetic number, because the mean of its divisors is an integer number (481950).
Almost surely, 210157952 is an apocalyptic number.
10157952 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 10157952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15422400).
10157952 is an abundant number, since it is smaller than the sum of its proper divisors (20686848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10157952 is an equidigital number, since it uses as much as digits as its factorization.
10157952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3803 (or 3791 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 30.
The square root of 10157952 is about 3187.1542165386. The cubic root of 10157952 is about 216.5718727997.
The spelling of 10157952 in words is "ten million, one hundred fifty-seven thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •