Base | Representation |
---|---|
bin | 1100001101010… |
… | …01001010000000 |
3 | 21010200200220000 |
4 | 12012221022000 |
5 | 202203422421 |
6 | 14054520000 |
7 | 2352266040 |
oct | 606511200 |
9 | 233620800 |
10 | 102404736 |
11 | 52894215 |
12 | 2a366000 |
13 | 182a6225 |
14 | d859720 |
15 | 8ecc226 |
hex | 61a9280 |
102404736 has 320 divisors, whose sum is σ = 373222080. Its totient is φ = 27205632.
The previous prime is 102404723. The next prime is 102404747. The reversal of 102404736 is 637404201.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1233751 + ... + 1233833.
It is an arithmetic number, because the mean of its divisors is an integer number (1166319).
Almost surely, 2102404736 is an apocalyptic number.
102404736 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 102404736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (186611040).
102404736 is an abundant number, since it is smaller than the sum of its proper divisors (270817344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102404736 is an equidigital number, since it uses as much as digits as its factorization.
102404736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133 (or 112 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 27.
The square root of 102404736 is about 10119.5225183800. The cubic root of 102404736 is about 467.8500505800.
Adding to 102404736 its reverse (637404201), we get a palindrome (739808937).
The spelling of 102404736 in words is "one hundred two million, four hundred four thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •