Base | Representation |
---|---|
bin | 101110100100011010… |
… | …000111111110000000 |
3 | 11210001210101011002120 |
4 | 232210122013332000 |
5 | 1304401223431224 |
6 | 34545424444240 |
7 | 3420056036232 |
oct | 564432077600 |
9 | 153053334076 |
10 | 50002952064 |
11 | 1a22a3a9a7a |
12 | 9835a79680 |
13 | 493b564600 |
14 | 25c4c9c252 |
15 | 1479c79779 |
hex | ba4687f80 |
50002952064 has 192 divisors, whose sum is σ = 144979568640. Its totient is φ = 15261861888.
The previous prime is 50002951997. The next prime is 50002952081. The reversal of 50002952064 is 46025920005.
It is a tau number, because it is divible by the number of its divisors (192).
It is a super-2 number, since 2×500029520642 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 8238759 + ... + 8244825.
It is an arithmetic number, because the mean of its divisors is an integer number (755101920).
Almost surely, 250002952064 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 50002952064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72489784320).
50002952064 is an abundant number, since it is smaller than the sum of its proper divisors (94976616576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50002952064 is a wasteful number, since it uses less digits than its factorization.
50002952064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6237 (or 6212 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
The spelling of 50002952064 in words is "fifty billion, two million, nine hundred fifty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •