Base | Representation |
---|---|
bin | 101110111111110010… |
… | …100110011011110101 |
3 | 11211020210211010220021 |
4 | 232333302212123311 |
5 | 1311321330300031 |
6 | 35103155205141 |
7 | 3434334632044 |
oct | 567762463365 |
9 | 154223733807 |
10 | 50462353141 |
11 | 1a445756892 |
12 | 99438a67b1 |
13 | 49b27a3375 |
14 | 2629cc655b |
15 | 14a5273511 |
hex | bbfca66f5 |
50462353141 has 4 divisors (see below), whose sum is σ = 51693142284. Its totient is φ = 49231564000.
The previous prime is 50462353127. The next prime is 50462353153. The reversal of 50462353141 is 14135326405.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1586428900 + 48875924241 = 39830^2 + 221079^2 .
It is a cyclic number.
It is not a de Polignac number, because 50462353141 - 27 = 50462353013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50462353097 and 50462353106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50462353741) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 615394510 + ... + 615394591.
It is an arithmetic number, because the mean of its divisors is an integer number (12923285571).
Almost surely, 250462353141 is an apocalyptic number.
It is an amenable number.
50462353141 is a deficient number, since it is larger than the sum of its proper divisors (1230789143).
50462353141 is a wasteful number, since it uses less digits than its factorization.
50462353141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1230789142.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 50462353141 its reverse (14135326405), we get a palindrome (64597679546).
The spelling of 50462353141 in words is "fifty billion, four hundred sixty-two million, three hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •