Base | Representation |
---|---|
bin | 101110110000100001… |
… | …011110011010100001 |
3 | 11210120221211111112100 |
4 | 232300201132122201 |
5 | 1310310242034401 |
6 | 35021525121013 |
7 | 3425104464156 |
oct | 566041363241 |
9 | 153527744470 |
10 | 50206205601 |
11 | 1a324104402 |
12 | 9891b59169 |
13 | 49716ba786 |
14 | 2603c8a22d |
15 | 148ca27b86 |
hex | bb085e6a1 |
50206205601 has 12 divisors (see below), whose sum is σ = 75020767380. Its totient is φ = 32316637920.
The previous prime is 50206205597. The next prime is 50206205617. The reversal of 50206205601 is 10650260205.
50206205601 is a `hidden beast` number, since 50 + 2 + 0 + 6 + 2 + 0 + 5 + 601 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 36176040000 + 14030165601 = 190200^2 + 118449^2 .
It is not a de Polignac number, because 50206205601 - 22 = 50206205597 is a prime.
It is not an unprimeable number, because it can be changed into a prime (50206205671) 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 11 ways as a sum of consecutive naturals, for example, 96180210 + ... + 96180731.
It is an arithmetic number, because the mean of its divisors is an integer number (6251730615).
Almost surely, 250206205601 is an apocalyptic number.
It is an amenable number.
50206205601 is a deficient number, since it is larger than the sum of its proper divisors (24814561779).
50206205601 is a wasteful number, since it uses less digits than its factorization.
50206205601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192360976 (or 192360973 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 50206205601 its reverse (10650260205), we get a palindrome (60856465806).
The spelling of 50206205601 in words is "fifty billion, two hundred six million, two hundred five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •