Base | Representation |
---|---|
bin | 100111010011… |
… | …110110000000 |
3 | 201101112122211 |
4 | 213103312000 |
5 | 10114224041 |
6 | 1004511504 |
7 | 153406300 |
oct | 47236600 |
9 | 21345584 |
10 | 10304896 |
11 | 58a9248 |
12 | 354b594 |
13 | 219a594 |
14 | 1523600 |
15 | d88481 |
hex | 9d3d80 |
10304896 has 96 divisors (see below), whose sum is σ = 25116480. Its totient is φ = 4193280.
The previous prime is 10304887. The next prime is 10304909. The reversal of 10304896 is 69840301.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 194406 + ... + 194458.
It is an arithmetic number, because the mean of its divisors is an integer number (261630).
Almost surely, 210304896 is an apocalyptic number.
10304896 is a gapful number since it is divisible by the number (16) 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 10304896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12558240).
10304896 is an abundant number, since it is smaller than the sum of its proper divisors (14811584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10304896 is an equidigital number, since it uses as much as digits as its factorization.
10304896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112 (or 93 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 31.
The square root of 10304896 is about 3210.1239851445. The cubic root of 10304896 is about 217.6111802214.
The spelling of 10304896 in words is "ten million, three hundred four thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •