Base | Representation |
---|---|
bin | 11101100100111… |
… | …101110000011000 |
3 | 1021120202001202200 |
4 | 131210331300120 |
5 | 2004013320100 |
6 | 121123530200 |
7 | 15203610642 |
oct | 3544756030 |
9 | 1246661680 |
10 | 496229400 |
11 | 235121547 |
12 | 11a229960 |
13 | 7ba64a84 |
14 | 49c93892 |
15 | 2d870e00 |
hex | 1d93dc18 |
496229400 has 144 divisors (see below), whose sum is σ = 1720455360. Its totient is φ = 128044800.
The previous prime is 496229387. The next prime is 496229413. The reversal of 496229400 is 4922694.
It is an interprime number because it is at equal distance from previous prime (496229387) and next prime (496229413).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 51354 + ... + 60246.
Almost surely, 2496229400 is an apocalyptic number.
496229400 is a gapful number since it is divisible by the number (40) 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 496229400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (860227680).
496229400 is an abundant number, since it is smaller than the sum of its proper divisors (1224225960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
496229400 is a wasteful number, since it uses less digits than its factorization.
496229400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8946 (or 8934 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 36.
The square root of 496229400 is about 22276.2070380036. The cubic root of 496229400 is about 791.7003381185.
The spelling of 496229400 in words is "four hundred ninety-six million, two hundred twenty-nine thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •