Base | Representation |
---|---|
bin | 101110100100111000… |
… | …110111011110111101 |
3 | 11210002100112120212212 |
4 | 232210320313132331 |
5 | 1304410304323010 |
6 | 34550313310205 |
7 | 3420214402544 |
oct | 564470673675 |
9 | 153070476785 |
10 | 50011011005 |
11 | 1a233a0385a |
12 | 9838705365 |
13 | 4940126807 |
14 | 25c5d9915b |
15 | 147a81c505 |
hex | ba4e377bd |
50011011005 has 4 divisors (see below), whose sum is σ = 60013213212. Its totient is φ = 40008808800.
The previous prime is 50011010977. The next prime is 50011011013.
50011011005 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 26573238169 + 23437772836 = 163013^2 + 153094^2 .
It is a de Polignac number, because none of the positive numbers 2k-50011011005 is a prime.
It is a super-2 number, since 2×500110110052 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5001101096 + ... + 5001101105.
It is an arithmetic number, because the mean of its divisors is an integer number (15003303303).
Almost surely, 250011011005 is an apocalyptic number.
It is an amenable number.
50011011005 is a deficient number, since it is larger than the sum of its proper divisors (10002202207).
50011011005 is a wasteful number, since it uses less digits than its factorization.
50011011005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10002202206.
The product of its (nonzero) digits is 25, while the sum is 14.
It can be divided in two parts, 500110 and 11005, that added together give a palindrome (511115).
The spelling of 50011011005 in words is "fifty billion, eleven million, eleven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •