Base | Representation |
---|---|
bin | 101110101010110100… |
… | …000011010110110011 |
3 | 11210100021120200201000 |
4 | 232222310003112303 |
5 | 1310111231142321 |
6 | 35004224013043 |
7 | 3422532322146 |
oct | 565264032663 |
9 | 153307520630 |
10 | 50110412211 |
11 | 1a285026412 |
12 | 9865a61183 |
13 | 49578ba8b2 |
14 | 25d527205d |
15 | 1484404826 |
hex | baad035b3 |
50110412211 has 16 divisors (see below), whose sum is σ = 74324713120. Its totient is φ = 33367762080.
The previous prime is 50110412203. The next prime is 50110412227. The reversal of 50110412211 is 11221401105.
It is not a de Polignac number, because 50110412211 - 23 = 50110412203 is a prime.
It is a super-2 number, since 2×501104122112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50110412111) 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 15 ways as a sum of consecutive naturals, for example, 1064860 + ... + 1110921.
It is an arithmetic number, because the mean of its divisors is an integer number (4645294570).
Almost surely, 250110412211 is an apocalyptic number.
50110412211 is a deficient number, since it is larger than the sum of its proper divisors (24214300909).
50110412211 is a wasteful number, since it uses less digits than its factorization.
50110412211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2176643 (or 2176637 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 18.
Adding to 50110412211 its reverse (11221401105), we get a palindrome (61331813316).
It can be divided in two parts, 501104 and 12211, that added together give a palindrome (513315).
The spelling of 50110412211 in words is "fifty billion, one hundred ten million, four hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •