Base | Representation |
---|---|
bin | 101110101010001101… |
… | …101001101011000101 |
3 | 11210022120122020211101 |
4 | 232222031221223011 |
5 | 1310101142024131 |
6 | 35003224140101 |
7 | 3422350624231 |
oct | 565215515305 |
9 | 153276566741 |
10 | 50100345541 |
11 | 1a27a380154 |
12 | 9862607631 |
13 | 49557a489c |
14 | 25d3bb15c1 |
15 | 14835b6c61 |
hex | baa369ac5 |
50100345541 has 8 divisors (see below), whose sum is σ = 52326519840. Its totient is φ = 47920071888.
The previous prime is 50100345521. The next prime is 50100345551. The reversal of 50100345541 is 14554300105.
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 50100345541 - 225 = 50066791109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50100345511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11472931 + ... + 11477296.
It is an arithmetic number, because the mean of its divisors is an integer number (6540814980).
Almost surely, 250100345541 is an apocalyptic number.
It is an amenable number.
50100345541 is a deficient number, since it is larger than the sum of its proper divisors (2226174299).
50100345541 is a wasteful number, since it uses less digits than its factorization.
50100345541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22950323.
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 50100345541 its reverse (14554300105), we get a palindrome (64654645646).
It can be divided in two parts, 50100 and 345541, that added together give a square (395641 = 6292).
The spelling of 50100345541 in words is "fifty billion, one hundred million, three hundred forty-five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •