Base | Representation |
---|---|
bin | 10110110000101010011010… |
… | …10000011010110010110001 |
3 | 20120012210012212222212110210 |
4 | 23120111031100122302301 |
5 | 23030012011303044334 |
6 | 254240523312214333 |
7 | 13354014200644110 |
oct | 1330251520326261 |
9 | 216183185885423 |
10 | 50050550049969 |
11 | 14a47356762897 |
12 | 574416bb3a3a9 |
13 | 21c099241cb51 |
14 | c50660ddbc77 |
15 | 5bbde29575e9 |
hex | 2d854d41acb1 |
50050550049969 has 8 divisors (see below), whose sum is σ = 76267504838080. Its totient is φ = 28600314314256.
The previous prime is 50050550049961. The next prime is 50050550049991. The reversal of 50050550049969 is 96994005505005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 50050550049969 - 23 = 50050550049961 is a prime.
It is a super-2 number, since 2×500505500499692 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (50050550049961) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1191679763074 + ... + 1191679763115.
It is an arithmetic number, because the mean of its divisors is an integer number (9533438104760).
Almost surely, 250050550049969 is an apocalyptic number.
It is an amenable number.
50050550049969 is a deficient number, since it is larger than the sum of its proper divisors (26216954788111).
50050550049969 is a wasteful number, since it uses less digits than its factorization.
50050550049969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2383359526199.
The product of its (nonzero) digits is 10935000, while the sum is 57.
The spelling of 50050550049969 in words is "fifty trillion, fifty billion, five hundred fifty million, forty-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •