Base | Representation |
---|---|
bin | 1011111010001… |
… | …0000111000000 |
3 | 10110222120111120 |
4 | 2332202013000 |
5 | 100241301242 |
6 | 4542312240 |
7 | 1144354200 |
oct | 276420700 |
9 | 113876446 |
10 | 49947072 |
11 | 26214a7a |
12 | 14888680 |
13 | a46a2a6 |
14 | 68c2400 |
15 | 45b91ec |
hex | 2fa21c0 |
49947072 has 84 divisors (see below), whose sum is σ = 153756360. Its totient is φ = 14267904.
The previous prime is 49947059. The next prime is 49947101. The reversal of 49947072 is 27074994.
It is a tau number, because it is divible by the number of its divisors (84).
It is a Harshad number since it is a multiple of its sum of digits (42).
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, 6754 + ... + 12062.
Almost surely, 249947072 is an apocalyptic number.
49947072 is a gapful number since it is divisible by the number (42) 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 49947072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76878180).
49947072 is an abundant number, since it is smaller than the sum of its proper divisors (103809288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49947072 is a wasteful number, since it uses less digits than its factorization.
49947072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5338 (or 5321 counting only the distinct ones).
The product of its (nonzero) digits is 127008, while the sum is 42.
The square root of 49947072 is about 7067.3242461345. The cubic root of 49947072 is about 368.2731116894.
The spelling of 49947072 in words is "forty-nine million, nine hundred forty-seven thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •