Base | Representation |
---|---|
bin | 1011111010000… |
… | …0111010001000 |
3 | 10110222022202100 |
4 | 2332200322020 |
5 | 100241122102 |
6 | 4542233400 |
7 | 1144333641 |
oct | 276407210 |
9 | 113868670 |
10 | 49942152 |
11 | 26211307 |
12 | 14885860 |
13 | a467c90 |
14 | 68c06c8 |
15 | 45b7a1c |
hex | 2fa0e88 |
49942152 has 96 divisors (see below), whose sum is σ = 146928600. Its totient is φ = 15234048.
The previous prime is 49942133. The next prime is 49942163. The reversal of 49942152 is 25124994.
It can be written as a sum of positive squares in 4 ways, for example, as 39012516 + 10929636 = 6246^2 + 3306^2 .
It is a super-2 number, since 2×499421522 = 4988437092782208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
Its product of digits (25920) is a multiple of the sum of its prime divisors (480).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 214228 + ... + 214460.
Almost surely, 249942152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 49942152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73464300).
49942152 is an abundant number, since it is smaller than the sum of its proper divisors (96986448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49942152 is a wasteful number, since it uses less digits than its factorization.
49942152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 487 (or 480 counting only the distinct ones).
The product of its digits is 25920, while the sum is 36.
The square root of 49942152 is about 7066.9761567448. The cubic root of 49942152 is about 368.2610191340.
The spelling of 49942152 in words is "forty-nine million, nine hundred forty-two thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •