Base | Representation |
---|---|
bin | 100111010001… |
… | …010111001000 |
3 | 201101000201020 |
4 | 213101113020 |
5 | 10113412403 |
6 | 1004352440 |
7 | 153334533 |
oct | 47212710 |
9 | 21330636 |
10 | 10294728 |
11 | 58a1644 |
12 | 3545720 |
13 | 2195a72 |
14 | 151da1a |
15 | d85453 |
hex | 9d15c8 |
10294728 has 64 divisors (see below), whose sum is σ = 27025920. Its totient is φ = 3264000.
The previous prime is 10294703. The next prime is 10294729. The reversal of 10294728 is 82749201.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (10294729) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 75076 + ... + 75212.
It is an arithmetic number, because the mean of its divisors is an integer number (422280).
Almost surely, 210294728 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 10294728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13512960).
10294728 is an abundant number, since it is smaller than the sum of its proper divisors (16731192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10294728 is a wasteful number, since it uses less digits than its factorization.
10294728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278 (or 274 counting only the distinct ones).
The product of its (nonzero) digits is 8064, while the sum is 33.
The square root of 10294728 is about 3208.5398548249. The cubic root of 10294728 is about 217.5395832304.
It can be divided in two parts, 102 and 94728, that added together give a triangular number (94830 = T435).
The spelling of 10294728 in words is "ten million, two hundred ninety-four thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •