Base | Representation |
---|---|
bin | 101110110011110010… |
… | …110100001110000011 |
3 | 11210201210002120012000 |
4 | 232303302310032003 |
5 | 1310413314124021 |
6 | 35031205235043 |
7 | 3426342104466 |
oct | 566362641603 |
9 | 153653076160 |
10 | 50261083011 |
11 | 1a352086637 |
12 | 98a8402a83 |
13 | 497cb92c09 |
14 | 260b2932dd |
15 | 1492767b26 |
hex | bb3cb4383 |
50261083011 has 32 divisors (see below), whose sum is σ = 75411840000. Its totient is φ = 33080029344.
The previous prime is 50261083009. The next prime is 50261083031. The reversal of 50261083011 is 11038016205.
50261083011 is a `hidden beast` number, since 5 + 0 + 2 + 610 + 8 + 30 + 11 = 666.
It is not a de Polignac number, because 50261083011 - 21 = 50261083009 is a prime.
It is a super-2 number, since 2×502610830112 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (50261083031) 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, 3464070 + ... + 3478548.
It is an arithmetic number, because the mean of its divisors is an integer number (2356620000).
Almost surely, 250261083011 is an apocalyptic number.
50261083011 is a deficient number, since it is larger than the sum of its proper divisors (25150756989).
50261083011 is a wasteful number, since it uses less digits than its factorization.
50261083011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16120 (or 16114 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
Adding to 50261083011 its reverse (11038016205), we get a palindrome (61299099216).
The spelling of 50261083011 in words is "fifty billion, two hundred sixty-one million, eighty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •