Base | Representation |
---|---|
bin | 101111000010000110… |
… | …111110110100000010 |
3 | 11211100112000022210000 |
4 | 233002012332310002 |
5 | 1311411310002211 |
6 | 35111105020430 |
7 | 3435316354623 |
oct | 570206766402 |
9 | 154315008700 |
10 | 50501250306 |
11 | 1a465703901 |
12 | 9954924716 |
13 | 49ba871c40 |
14 | 263112da4a |
15 | 14a88a8656 |
hex | bc21bed02 |
50501250306 has 80 divisors (see below), whose sum is σ = 121918724928. Its totient is φ = 15531976800.
The previous prime is 50501250299. The next prime is 50501250323. The reversal of 50501250306 is 60305210505.
50501250306 is a `hidden beast` number, since 505 + 0 + 125 + 0 + 30 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 50501250306.
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 39 ways as a sum of consecutive naturals, for example, 6885061 + ... + 6892391.
Almost surely, 250501250306 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50501250306, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60959362464).
50501250306 is an abundant number, since it is smaller than the sum of its proper divisors (71417474622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50501250306 is a wasteful number, since it uses less digits than its factorization.
50501250306 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10629 (or 10620 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The spelling of 50501250306 in words is "fifty billion, five hundred one million, two hundred fifty thousand, three hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •