Base | Representation |
---|---|
bin | 101110100001000100… |
… | …111001011100010101 |
3 | 11202220220012022222000 |
4 | 232201010321130111 |
5 | 1304242421242033 |
6 | 34540110425513 |
7 | 3415506653520 |
oct | 564104713425 |
9 | 152826168860 |
10 | 49947055893 |
11 | 1a2008a1399 |
12 | 981b202299 |
13 | 492cac3557 |
14 | 25bb6abbb7 |
15 | 1474dd7a13 |
hex | ba1139715 |
49947055893 has 32 divisors (see below), whose sum is σ = 86162054400. Its totient is φ = 28002656448.
The previous prime is 49947055813. The next prime is 49947055901. The reversal of 49947055893 is 39855074994.
49947055893 is a `hidden beast` number, since 4 + 9 + 9 + 4 + 70 + 558 + 9 + 3 = 666.
It is not a de Polignac number, because 49947055893 - 28 = 49947055637 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a self number, because there is not a number n which added to its sum of digits gives 49947055893.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49947055813) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 2483098 + ... + 2503131.
It is an arithmetic number, because the mean of its divisors is an integer number (2692564200).
Almost surely, 249947055893 is an apocalyptic number.
It is an amenable number.
49947055893 is a deficient number, since it is larger than the sum of its proper divisors (36214998507).
49947055893 is a wasteful number, since it uses less digits than its factorization.
49947055893 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4986298 (or 4986292 counting only the distinct ones).
The product of its (nonzero) digits is 48988800, while the sum is 63.
The spelling of 49947055893 in words is "forty-nine billion, nine hundred forty-seven million, fifty-five thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •