Base | Representation |
---|---|
bin | 10110101111100000101111… |
… | …11100111110011101001011 |
3 | 20120002000010122120202122020 |
4 | 23113300113330332131023 |
5 | 23023340012232230201 |
6 | 254210423044055523 |
7 | 13351114141016661 |
oct | 1327602774763513 |
9 | 216060118522566 |
10 | 50011001055051 |
11 | 14a31601347623 |
12 | 57385730945a3 |
13 | 21ba02b9298ca |
14 | c4c78c6b0c31 |
15 | 5bad7a85ba36 |
hex | 2d7c17f3e74b |
50011001055051 has 4 divisors (see below), whose sum is σ = 66681334740072. Its totient is φ = 33340667370032.
The previous prime is 50011001054983. The next prime is 50011001055133. The reversal of 50011001055051 is 15055010011005.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 50011001055051 - 219 = 50011000530763 is a prime.
It is a super-2 number, since 2×500110010550512 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (50011001055751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8335166842506 + ... + 8335166842511.
It is an arithmetic number, because the mean of its divisors is an integer number (16670333685018).
Almost surely, 250011001055051 is an apocalyptic number.
50011001055051 is a deficient number, since it is larger than the sum of its proper divisors (16670333685021).
50011001055051 is a wasteful number, since it uses less digits than its factorization.
50011001055051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16670333685020.
The product of its (nonzero) digits is 625, while the sum is 24.
Adding to 50011001055051 its reverse (15055010011005), we get a palindrome (65066011066056).
The spelling of 50011001055051 in words is "fifty trillion, eleven billion, one million, fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •