Base | Representation |
---|---|
bin | 1011111010010… |
… | …0111000000000 |
3 | 10111000011001010 |
4 | 2332210320000 |
5 | 100242132100 |
6 | 4542440520 |
7 | 1144432212 |
oct | 276447000 |
9 | 114004033 |
10 | 49958400 |
11 | 26222538 |
12 | 14893140 |
13 | a4724ab |
14 | 68c65b2 |
15 | 45bc750 |
hex | 2fa4e00 |
49958400 has 120 divisors (see below), whose sum is σ = 165161304. Its totient is φ = 13312000.
The previous prime is 49958347. The next prime is 49958401. The reversal of 49958400 is 485994.
It is a tau number, because it is divible by the number of its divisors (120).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49958401) 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 11 ways as a sum of consecutive naturals, for example, 37750 + ... + 39050.
Almost surely, 249958400 is an apocalyptic number.
49958400 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 49958400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82580652).
49958400 is an abundant number, since it is smaller than the sum of its proper divisors (115202904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49958400 is a wasteful number, since it uses less digits than its factorization.
49958400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1332 (or 1311 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 39.
The square root of 49958400 is about 7068.1256355557. The cubic root of 49958400 is about 368.3009510421.
The spelling of 49958400 in words is "forty-nine million, nine hundred fifty-eight thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •