Base | Representation |
---|---|
bin | 101111001000010010… |
… | …110001100011110001 |
3 | 11211121202020121111222 |
4 | 233020102301203301 |
5 | 1312114340130131 |
6 | 35125252514425 |
7 | 3441016305563 |
oct | 571022614361 |
9 | 154552217458 |
10 | 50605005041 |
11 | 1a50922a318 |
12 | 998361ba15 |
13 | 4a061cb786 |
14 | 2640c1b333 |
15 | 14b2a5087b |
hex | bc84b18f1 |
50605005041 has 4 divisors (see below), whose sum is σ = 50610196032. Its totient is φ = 50599814052.
The previous prime is 50605005037. The next prime is 50605005247. The reversal of 50605005041 is 14050050605.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50605005041 - 22 = 50605005037 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50605005041.
It is not an unprimeable number, because it can be changed into a prime (50605005541) 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 3 ways as a sum of consecutive naturals, for example, 2580845 + ... + 2600378.
It is an arithmetic number, because the mean of its divisors is an integer number (12652549008).
Almost surely, 250605005041 is an apocalyptic number.
It is an amenable number.
50605005041 is a deficient number, since it is larger than the sum of its proper divisors (5190991).
50605005041 is an equidigital number, since it uses as much as digits as its factorization.
50605005041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5190990.
The product of its (nonzero) digits is 3000, while the sum is 26.
Adding to 50605005041 its reverse (14050050605), we get a palindrome (64655055646).
The spelling of 50605005041 in words is "fifty billion, six hundred five million, five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •