Base | Representation |
---|---|
bin | 1011110101000… |
… | …0010100010010 |
3 | 10110100112221100 |
4 | 2331100110102 |
5 | 100200041200 |
6 | 4531205230 |
7 | 1141460355 |
oct | 275202422 |
9 | 113315840 |
10 | 49612050 |
11 | 260062a4 |
12 | 14746816 |
13 | a380957 |
14 | 683629c |
15 | 454ed00 |
hex | 2f50512 |
49612050 has 72 divisors (see below), whose sum is σ = 136592820. Its totient is φ = 12902400.
The previous prime is 49612049. The next prime is 49612061. The reversal of 49612050 is 5021694.
49612050 is a `hidden beast` number, since 49 + 612 + 0 + 5 + 0 = 666.
It can be written as a sum of positive squares in 6 ways, for example, as 205209 + 49406841 = 453^2 + 7029^2 .
It is a super-2 number, since 2×496120502 = 4922711010405000, which contains 22 as substring.
It is a Curzon 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 35 ways as a sum of consecutive naturals, for example, 17106 + ... + 19794.
Almost surely, 249612050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 49612050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68296410).
49612050 is an abundant number, since it is smaller than the sum of its proper divisors (86980770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49612050 is a wasteful number, since it uses less digits than its factorization.
49612050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2748 (or 2740 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 49612050 is about 7043.5821852237. The cubic root of 49612050 is about 367.4478615468.
The spelling of 49612050 in words is "forty-nine million, six hundred twelve thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •