Base | Representation |
---|---|
bin | 1011101011111… |
… | …0000100111111 |
3 | 10102020010021100 |
4 | 2322332010333 |
5 | 100021404210 |
6 | 4510304143 |
7 | 1133414130 |
oct | 272760477 |
9 | 112203240 |
10 | 49013055 |
11 | 25737263 |
12 | 144b8053 |
13 | a201110 |
14 | 671bc87 |
15 | 44825c0 |
hex | 2ebe13f |
49013055 has 48 divisors (see below), whose sum is σ = 104569920. Its totient is φ = 20680704.
The previous prime is 49013017. The next prime is 49013087. The reversal of 49013055 is 55031094.
It is not a de Polignac number, because 49013055 - 210 = 49012031 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1890 + ... + 10079.
It is an arithmetic number, because the mean of its divisors is an integer number (2178540).
Almost surely, 249013055 is an apocalyptic number.
49013055 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
49013055 is an abundant number, since it is smaller than the sum of its proper divisors (55556865).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49013055 is a wasteful number, since it uses less digits than its factorization.
49013055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12000 (or 11997 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The square root of 49013055 is about 7000.9324378971. The cubic root of 49013055 is about 365.9630662363.
The spelling of 49013055 in words is "forty-nine million, thirteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •