Base | Representation |
---|---|
bin | 101110101010100100… |
… | …000000100010000000 |
3 | 11210022222200000022212 |
4 | 232222210000202000 |
5 | 1310104142100321 |
6 | 35003553521252 |
7 | 3422451504134 |
oct | 565244004200 |
9 | 153288600285 |
10 | 50106206336 |
11 | 1a28271348a |
12 | 9864573228 |
13 | 4956a77404 |
14 | 25d48993c4 |
15 | 1483d7355b |
hex | baa900880 |
50106206336 has 64 divisors (see below), whose sum is σ = 101909016000. Its totient is φ = 24533806080.
The previous prime is 50106206263. The next prime is 50106206363. The reversal of 50106206336 is 63360260105.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1335611 + ... + 1372613.
It is an arithmetic number, because the mean of its divisors is an integer number (1592328375).
Almost surely, 250106206336 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 50106206336, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50954508000).
50106206336 is an abundant number, since it is smaller than the sum of its proper divisors (51802809664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50106206336 is a wasteful number, since it uses less digits than its factorization.
50106206336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37237 (or 37225 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 32.
The spelling of 50106206336 in words is "fifty billion, one hundred six million, two hundred six thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •