Base | Representation |
---|---|
bin | 10110100101001110100000… |
… | …00110001000001100111010 |
3 | 20111211012222002112110210120 |
4 | 23102213100012020030322 |
5 | 23002042240143121232 |
6 | 253340220144154110 |
7 | 13313433552064230 |
oct | 1322472006101472 |
9 | 214735862473716 |
10 | 49657608176442 |
11 | 14905745276372 |
12 | 569bb88608936 |
13 | 2192900159a06 |
14 | c396263a6950 |
15 | 5b1a95a0a92c |
hex | 2d29d018833a |
49657608176442 has 32 divisors (see below), whose sum is σ = 118438021988352. Its totient is φ = 13571023352304.
The previous prime is 49657608176359. The next prime is 49657608176447. The reversal of 49657608176442 is 24467180675694.
It is a Harshad number since it is a multiple of its sum of digits (69).
It is not an unprimeable number, because it can be changed into a prime (49657608176447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25702694778 + ... + 25702696709.
It is an arithmetic number, because the mean of its divisors is an integer number (3701188187136).
Almost surely, 249657608176442 is an apocalyptic number.
49657608176442 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
49657608176442 is an abundant number, since it is smaller than the sum of its proper divisors (68780413811910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49657608176442 is a wasteful number, since it uses less digits than its factorization.
49657608176442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51405391522.
The product of its (nonzero) digits is 487710720, while the sum is 69.
The spelling of 49657608176442 in words is "forty-nine trillion, six hundred fifty-seven billion, six hundred eight million, one hundred seventy-six thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •