Base | Representation |
---|---|
bin | 101110100100111001… |
… | …000011011110110111 |
3 | 11210002100122002022002 |
4 | 232210321003132313 |
5 | 1304410312411101 |
6 | 34550314325515 |
7 | 3420214666043 |
oct | 564471033667 |
9 | 153070562262 |
10 | 50011060151 |
11 | 1a233a37778 |
12 | 983872989b |
13 | 4940142cb0 |
14 | 25c5dad023 |
15 | 147a82bd6b |
hex | ba4e437b7 |
50011060151 has 8 divisors (see below), whose sum is σ = 54219530400. Its totient is φ = 45854227872.
The previous prime is 50011060147. The next prime is 50011060153. The reversal of 50011060151 is 15106011005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50011060151 - 22 = 50011060147 is a prime.
It is a super-2 number, since 2×500110601512 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50011060153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12907475 + ... + 12911348.
It is an arithmetic number, because the mean of its divisors is an integer number (6777441300).
Almost surely, 250011060151 is an apocalyptic number.
50011060151 is a deficient number, since it is larger than the sum of its proper divisors (4208470249).
50011060151 is a wasteful number, since it uses less digits than its factorization.
50011060151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25818985.
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 50011060151 its reverse (15106011005), we get a palindrome (65117071156).
The spelling of 50011060151 in words is "fifty billion, eleven million, sixty thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •