Base | Representation |
---|---|
bin | 1011101101101… |
… | …0110001000100 |
3 | 10102110002110112 |
4 | 2323122301010 |
5 | 100034134224 |
6 | 4513012152 |
7 | 1134413540 |
oct | 273326104 |
9 | 112402415 |
10 | 49130564 |
11 | 2580757a |
12 | 14554058 |
13 | a242752 |
14 | 674ca20 |
15 | 44a730e |
hex | 2edac44 |
49130564 has 24 divisors (see below), whose sum is σ = 99731520. Its totient is φ = 20740896.
The previous prime is 49130563. The next prime is 49130569. The reversal of 49130564 is 46503194.
49130564 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 49130564.
It is not an unprimeable number, because it can be changed into a prime (49130563) 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 7 ways as a sum of consecutive naturals, for example, 11219 + ... + 14970.
It is an arithmetic number, because the mean of its divisors is an integer number (4155480).
Almost surely, 249130564 is an apocalyptic number.
It is an amenable number.
49130564 is an abundant number, since it is smaller than the sum of its proper divisors (50600956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49130564 is a wasteful number, since it uses less digits than its factorization.
49130564 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26267 (or 26265 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 32.
The square root of 49130564 is about 7009.3197958147. The cubic root of 49130564 is about 366.2552988008.
It can be divided in two parts, 49130 and 564, that added together give a palindrome (49694).
The spelling of 49130564 in words is "forty-nine million, one hundred thirty thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •