Base | Representation |
---|---|
bin | 101110101010110010… |
… | …100001010011110101 |
3 | 11210100020211021211000 |
4 | 232222302201103311 |
5 | 1310111130314423 |
6 | 35004211233513 |
7 | 3422526030255 |
oct | 565262412365 |
9 | 153306737730 |
10 | 50110010613 |
11 | 1a284881713 |
12 | 98658a8899 |
13 | 49577a9b70 |
14 | 25d51a9965 |
15 | 1484375843 |
hex | baaca14f5 |
50110010613 has 32 divisors (see below), whose sum is σ = 80112032000. Its totient is φ = 30773504448.
The previous prime is 50110010557. The next prime is 50110010617. The reversal of 50110010613 is 31601001105.
50110010613 is a `hidden beast` number, since 50 + 1 + 1 + 0 + 0 + 1 + 0 + 613 = 666.
It is not a de Polignac number, because 50110010613 - 212 = 50110006517 is a prime.
It is a super-2 number, since 2×501100106132 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50110010617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24363 + ... + 317511.
It is an arithmetic number, because the mean of its divisors is an integer number (2503501000).
Almost surely, 250110010613 is an apocalyptic number.
It is an amenable number.
50110010613 is a deficient number, since it is larger than the sum of its proper divisors (30002021387).
50110010613 is a wasteful number, since it uses less digits than its factorization.
50110010613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293658 (or 293652 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 18.
Adding to 50110010613 its reverse (31601001105), we get a palindrome (81711011718).
The spelling of 50110010613 in words is "fifty billion, one hundred ten million, ten thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •