Base | Representation |
---|---|
bin | 101111001101010110… |
… | …011101001100010000 |
3 | 11211211122220111112011 |
4 | 233031112131030100 |
5 | 1312303100400042 |
6 | 35141523312304 |
7 | 3443066445346 |
oct | 571526351420 |
9 | 154748814464 |
10 | 50689856272 |
11 | 1a552114300 |
12 | 99a7b1b694 |
13 | 4a1a969cc3 |
14 | 264c1c7996 |
15 | 14ba211a17 |
hex | bcd59d310 |
50689856272 has 60 divisors (see below), whose sum is σ = 108153365068. Its totient is φ = 22997779200.
The previous prime is 50689856207. The next prime is 50689856279. The reversal of 50689856272 is 27265898605.
50689856272 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 30728687616 + 19961168656 = 175296^2 + 141284^2 .
It is not an unprimeable number, because it can be changed into a prime (50689856279) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1023178 + ... + 1071574.
Almost surely, 250689856272 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 50689856272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54076682534).
50689856272 is an abundant number, since it is smaller than the sum of its proper divisors (57463508796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50689856272 is a wasteful number, since it uses less digits than its factorization.
50689856272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48968 (or 48951 counting only the distinct ones).
The product of its (nonzero) digits is 14515200, while the sum is 58.
The spelling of 50689856272 in words is "fifty billion, six hundred eighty-nine million, eight hundred fifty-six thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •