Base | Representation |
---|---|
bin | 1011101101011… |
… | …1000010000110 |
3 | 10102102022111002 |
4 | 2323113002012 |
5 | 100033142040 |
6 | 4512413302 |
7 | 1134321131 |
oct | 273270206 |
9 | 112368432 |
10 | 49115270 |
11 | 257a7036 |
12 | 14547232 |
13 | a2387b9 |
14 | 6747218 |
15 | 44a2a15 |
hex | 2ed7086 |
49115270 has 32 divisors (see below), whose sum is σ = 91951200. Its totient is φ = 18866176.
The previous prime is 49115267. The next prime is 49115279. The reversal of 49115270 is 7251194.
49115270 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49115279) 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 15 ways as a sum of consecutive naturals, for example, 74201 + ... + 74859.
It is an arithmetic number, because the mean of its divisors is an integer number (2873475).
Almost surely, 249115270 is an apocalyptic number.
49115270 is a deficient number, since it is larger than the sum of its proper divisors (42835930).
49115270 is a wasteful number, since it uses less digits than its factorization.
49115270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 952.
The product of its (nonzero) digits is 2520, while the sum is 29.
The square root of 49115270 is about 7008.2287348516. The cubic root of 49115270 is about 366.2172906214.
The spelling of 49115270 in words is "forty-nine million, one hundred fifteen thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •