Base | Representation |
---|---|
bin | 10110110010011001001111… |
… | …01110101111000001101101 |
3 | 20120102110210112122202121201 |
4 | 23121030213232233001231 |
5 | 23032000340300130401 |
6 | 254324123354525501 |
7 | 13361221516140052 |
oct | 1331144756570155 |
9 | 216373715582551 |
10 | 50110050005101 |
11 | 14a6a609952829 |
12 | 57537b6436891 |
13 | 21c64853aa6a8 |
14 | c534a72c7029 |
15 | 5bd726333b01 |
hex | 2d9327baf06d |
50110050005101 has 8 divisors (see below), whose sum is σ = 51727601547008. Its totient is φ = 48492567108000.
The previous prime is 50110050005077. The next prime is 50110050005159. The reversal of 50110050005101 is 10150005001105.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50110050005101 - 223 = 50110041616493 is a prime.
It is a super-2 number, since 2×501100500051012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50110050005801) 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, 15675615 + ... + 18599596.
It is an arithmetic number, because the mean of its divisors is an integer number (6465950193376).
Almost surely, 250110050005101 is an apocalyptic number.
It is an amenable number.
50110050005101 is a deficient number, since it is larger than the sum of its proper divisors (1617551541907).
50110050005101 is a wasteful number, since it uses less digits than its factorization.
50110050005101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34322403.
The product of its (nonzero) digits is 125, while the sum is 19.
Adding to 50110050005101 its reverse (10150005001105), we get a palindrome (60260055006206).
The spelling of 50110050005101 in words is "fifty trillion, one hundred ten billion, fifty million, five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •