Base | Representation |
---|---|
bin | 101111000011001110… |
… | …111001011000000001 |
3 | 11211101211111002222202 |
4 | 233003032321120001 |
5 | 1311431121234101 |
6 | 35113021042545 |
7 | 3435635533166 |
oct | 570316713001 |
9 | 154354432882 |
10 | 50520102401 |
11 | 1a47530a74a |
12 | 995b0b6455 |
13 | 49c1742a22 |
14 | 263383a06d |
15 | 14aa37e36b |
hex | bc33b9601 |
50520102401 has 4 divisors (see below), whose sum is σ = 51885510612. Its totient is φ = 49154694192.
The previous prime is 50520102377. The next prime is 50520102403. The reversal of 50520102401 is 10420102505.
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 21039212401 + 29480890000 = 145049^2 + 171700^2 .
It is a cyclic number.
It is not a de Polignac number, because 50520102401 - 226 = 50452993537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50520102403) 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, 682704050 + ... + 682704123.
It is an arithmetic number, because the mean of its divisors is an integer number (12971377653).
Almost surely, 250520102401 is an apocalyptic number.
It is an amenable number.
50520102401 is a deficient number, since it is larger than the sum of its proper divisors (1365408211).
50520102401 is a wasteful number, since it uses less digits than its factorization.
50520102401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1365408210.
The product of its (nonzero) digits is 400, while the sum is 20.
Adding to 50520102401 its reverse (10420102505), we get a palindrome (60940204906).
The spelling of 50520102401 in words is "fifty billion, five hundred twenty million, one hundred two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •