Base | Representation |
---|---|
bin | 1011101101000… |
… | …1110010001010 |
3 | 10102101012222210 |
4 | 2323101302022 |
5 | 100032000040 |
6 | 4512125550 |
7 | 1134201345 |
oct | 273216212 |
9 | 112335883 |
10 | 49093770 |
11 | 25791970 |
12 | 145368b6 |
13 | a22ba8b |
14 | 673d45c |
15 | 449b480 |
hex | 2ed1c8a |
49093770 has 64 divisors (see below), whose sum is σ = 132710400. Its totient is φ = 11515200.
The previous prime is 49093763. The next prime is 49093771. The reversal of 49093770 is 7739094.
49093770 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (49093771) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7831 + ... + 12629.
It is an arithmetic number, because the mean of its divisors is an integer number (2073600).
Almost surely, 249093770 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 49093770, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66355200).
49093770 is an abundant number, since it is smaller than the sum of its proper divisors (83616630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49093770 is a wasteful number, since it uses less digits than its factorization.
49093770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4851.
The product of its (nonzero) digits is 47628, while the sum is 39.
The square root of 49093770 is about 7006.6946558274. The cubic root of 49093770 is about 366.1638461365.
The spelling of 49093770 in words is "forty-nine million, ninety-three thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •