Base | Representation |
---|---|
bin | 101111000011111100… |
… | …010111000010110001 |
3 | 11211102122220121102011 |
4 | 233003330113002301 |
5 | 1311442144123101 |
6 | 35114124322521 |
7 | 3436142041432 |
oct | 570374270261 |
9 | 154378817364 |
10 | 50532020401 |
11 | 1a48100a935 |
12 | 99630a3441 |
13 | 49c40565b5 |
14 | 263525d489 |
15 | 14ab435751 |
hex | bc3f170b1 |
50532020401 has 4 divisors (see below), whose sum is σ = 50573339712. Its totient is φ = 50490701092.
The previous prime is 50532020381. The next prime is 50532020417. The reversal of 50532020401 is 10402023505.
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, and also an emirpimes, since its reverse is a distinct semiprime: 10402023505 = 5 ⋅2080404701.
It is a cyclic number.
It is not a de Polignac number, because 50532020401 - 227 = 50397802673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50532020701) 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 3 ways as a sum of consecutive naturals, for example, 20657821 + ... + 20660266.
It is an arithmetic number, because the mean of its divisors is an integer number (12643334928).
Almost surely, 250532020401 is an apocalyptic number.
It is an amenable number.
50532020401 is a deficient number, since it is larger than the sum of its proper divisors (41319311).
50532020401 is a wasteful number, since it uses less digits than its factorization.
50532020401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41319310.
The product of its (nonzero) digits is 1200, while the sum is 22.
Adding to 50532020401 its reverse (10402023505), we get a palindrome (60934043906).
The spelling of 50532020401 in words is "fifty billion, five hundred thirty-two million, twenty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •