Base | Representation |
---|---|
bin | 101110100100100110… |
… | …101110101011100000 |
3 | 11210002000121000201121 |
4 | 232210212232223200 |
5 | 1304403100200402 |
6 | 34550023342024 |
7 | 3420126110563 |
oct | 564446565340 |
9 | 153060530647 |
10 | 50006256352 |
11 | 1a231256598 |
12 | 9836bb1914 |
13 | 493c150600 |
14 | 25c54bc4da |
15 | 147a1cd837 |
hex | ba49aeae0 |
50006256352 has 72 divisors (see below), whose sum is σ = 107705578176. Its totient is φ = 22841634816.
The previous prime is 50006256341. The next prime is 50006256367. The reversal of 50006256352 is 25365260005.
50006256352 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 476913 + ... + 572239.
It is an arithmetic number, because the mean of its divisors is an integer number (1495910808).
Almost surely, 250006256352 is an apocalyptic number.
50006256352 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50006256352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53852789088).
50006256352 is an abundant number, since it is smaller than the sum of its proper divisors (57699321824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50006256352 is a wasteful number, since it uses less digits than its factorization.
50006256352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95460 (or 95439 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 34.
The spelling of 50006256352 in words is "fifty billion, six million, two hundred fifty-six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •