Base | Representation |
---|---|
bin | 101110101101111001… |
… | …010001101100101001 |
3 | 11210110212212101021221 |
4 | 232231321101230221 |
5 | 1310213000111241 |
6 | 35013312102041 |
7 | 3424030633225 |
oct | 565571215451 |
9 | 153425771257 |
10 | 50162113321 |
11 | 1a301229201 |
12 | 987b234921 |
13 | 4965520378 |
14 | 25dc08d785 |
15 | 1488c185d1 |
hex | bade51b29 |
50162113321 has 4 divisors (see below), whose sum is σ = 50179080132. Its totient is φ = 50145146512.
The previous prime is 50162113283. The next prime is 50162113343. The reversal of 50162113321 is 12331126105.
It is a happy number.
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 35041968025 + 15120145296 = 187195^2 + 122964^2 .
It is a cyclic number.
It is not a de Polignac number, because 50162113321 - 217 = 50161982249 is a prime.
It is a super-2 number, since 2×501621133212 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50162113021) 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, 8478970 + ... + 8484883.
It is an arithmetic number, because the mean of its divisors is an integer number (12544770033).
Almost surely, 250162113321 is an apocalyptic number.
It is an amenable number.
50162113321 is a deficient number, since it is larger than the sum of its proper divisors (16966811).
50162113321 is a wasteful number, since it uses less digits than its factorization.
50162113321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16966810.
The product of its (nonzero) digits is 1080, while the sum is 25.
Adding to 50162113321 its reverse (12331126105), we get a palindrome (62493239426).
The spelling of 50162113321 in words is "fifty billion, one hundred sixty-two million, one hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •