Base | Representation |
---|---|
bin | 101110110010100110… |
… | …101001000000100111 |
3 | 11210200101112001001121 |
4 | 232302212221000213 |
5 | 1310343211123101 |
6 | 35025213234411 |
7 | 3426010265314 |
oct | 566246510047 |
9 | 153611461047 |
10 | 50241114151 |
11 | 1a341887748 |
12 | 98a1792a07 |
13 | 49789c0a17 |
14 | 2608775d0b |
15 | 1490b210a1 |
hex | bb29a9027 |
50241114151 has 8 divisors (see below), whose sum is σ = 50327301024. Its totient is φ = 50155000320.
The previous prime is 50241114149. The next prime is 50241114181. The reversal of 50241114151 is 15141114205.
It is a happy number.
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 50241114151 - 21 = 50241114149 is a prime.
It is a super-2 number, since 2×502411141512 (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 (50241114181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1459231 + ... + 1493263.
It is an arithmetic number, because the mean of its divisors is an integer number (6290912628).
Almost surely, 250241114151 is an apocalyptic number.
50241114151 is a deficient number, since it is larger than the sum of its proper divisors (86186873).
50241114151 is a wasteful number, since it uses less digits than its factorization.
50241114151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36521.
The product of its (nonzero) digits is 800, while the sum is 25.
Adding to 50241114151 its reverse (15141114205), we get a palindrome (65382228356).
The spelling of 50241114151 in words is "fifty billion, two hundred forty-one million, one hundred fourteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •