Base | Representation |
---|---|
bin | 1100000110010… |
… | …1100100011100 |
3 | 10112111020201120 |
4 | 3001211210130 |
5 | 100442411201 |
6 | 5011410540 |
7 | 1154230260 |
oct | 301454434 |
9 | 115436646 |
10 | 50747676 |
11 | 26711531 |
12 | 14bb3a50 |
13 | a68a815 |
14 | 6a500a0 |
15 | 46c6536 |
hex | 306591c |
50747676 has 96 divisors (see below), whose sum is σ = 140378112. Its totient is φ = 13970880.
The previous prime is 50747623. The next prime is 50747681. The reversal of 50747676 is 67674705.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 399525 + ... + 399651.
It is an arithmetic number, because the mean of its divisors is an integer number (1462272).
Almost surely, 250747676 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50747676, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (70189056).
50747676 is an abundant number, since it is smaller than the sum of its proper divisors (89630436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50747676 is a wasteful number, since it uses less digits than its factorization.
50747676 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279 (or 277 counting only the distinct ones).
The product of its (nonzero) digits is 246960, while the sum is 42.
The square root of 50747676 is about 7123.7403096969. The cubic root of 50747676 is about 370.2303800209.
The spelling of 50747676 in words is "fifty million, seven hundred forty-seven thousand, six hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •