Base | Representation |
---|---|
bin | 100110011010… |
… | …111110010000 |
3 | 200221201010021 |
4 | 212122332100 |
5 | 10034300302 |
6 | 555513224 |
7 | 151416202 |
oct | 46327620 |
9 | 20851107 |
10 | 10071952 |
11 | 575a230 |
12 | 3458814 |
13 | 2118547 |
14 | 14a2772 |
15 | d3e437 |
hex | 99af90 |
10071952 has 40 divisors (see below), whose sum is σ = 21561120. Its totient is φ = 4519680.
The previous prime is 10071923. The next prime is 10071979. The reversal of 10071952 is 25917001.
10071952 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×100719523 (a number of 22 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15343 + ... + 15985.
It is an arithmetic number, because the mean of its divisors is an integer number (539028).
Almost surely, 210071952 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10071952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10780560).
10071952 is an abundant number, since it is smaller than the sum of its proper divisors (11489168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10071952 is a wasteful number, since it uses less digits than its factorization.
10071952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 751 (or 745 counting only the distinct ones).
The product of its (nonzero) digits is 630, while the sum is 25.
The square root of 10071952 is about 3173.6338793251. The cubic root of 10071952 is about 215.9589542492.
Adding to 10071952 its reverse (25917001), we get a palindrome (35988953).
The spelling of 10071952 in words is "ten million, seventy-one thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.009 sec. • engine limits •