Base | Representation |
---|---|
bin | 1011111010010… |
… | …0010110101110 |
3 | 10111000001010020 |
4 | 2332210112232 |
5 | 100242100040 |
6 | 4542423010 |
7 | 1144423050 |
oct | 276442656 |
9 | 114001106 |
10 | 49956270 |
11 | 26220981 |
12 | 14891a66 |
13 | a471530 |
14 | 68c58d0 |
15 | 45bbcd0 |
hex | 2fa45ae |
49956270 has 128 divisors (see below), whose sum is σ = 152893440. Its totient is φ = 10160640.
The previous prime is 49956227. The next prime is 49956271. The reversal of 49956270 is 7265994.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49956271) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 78855 + ... + 79485.
It is an arithmetic number, because the mean of its divisors is an integer number (1194480).
Almost surely, 249956270 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 49956270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76446720).
49956270 is an abundant number, since it is smaller than the sum of its proper divisors (102937170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49956270 is a wasteful number, since it uses less digits than its factorization.
49956270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690.
The product of its (nonzero) digits is 136080, while the sum is 42.
The square root of 49956270 is about 7067.9749575108. The cubic root of 49956270 is about 368.2957167393.
The spelling of 49956270 in words is "forty-nine million, nine hundred fifty-six thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •