Base | Representation |
---|---|
bin | 101111001000110100… |
… | …001000101101110010 |
3 | 11211122100200221020010 |
4 | 233020310020231302 |
5 | 1312124110010032 |
6 | 35130204155350 |
7 | 3441153532140 |
oct | 571064105562 |
9 | 154570627203 |
10 | 50613750642 |
11 | 1a513162a94 |
12 | 9986538b56 |
13 | 4a07c713a0 |
14 | 2642056590 |
15 | 14b36cbccc |
hex | bc8d08b72 |
50613750642 has 64 divisors (see below), whose sum is σ = 130004582400. Its totient is φ = 12768300864.
The previous prime is 50613750641. The next prime is 50613750653. The reversal of 50613750642 is 24605731605.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 50613750642.
It is not an unprimeable number, because it can be changed into a prime (50613750641) 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, 2002642 + ... + 2027757.
It is an arithmetic number, because the mean of its divisors is an integer number (2031321600).
Almost surely, 250613750642 is an apocalyptic number.
50613750642 is an abundant number, since it is smaller than the sum of its proper divisors (79390831758).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50613750642 is a wasteful number, since it uses less digits than its factorization.
50613750642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4030447.
The product of its (nonzero) digits is 151200, while the sum is 39.
The spelling of 50613750642 in words is "fifty billion, six hundred thirteen million, seven hundred fifty thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •