Base | Representation |
---|---|
bin | 101111001011110000… |
… | …011010100011110001 |
3 | 11211202210120111011000 |
4 | 233023300122203301 |
5 | 1312224223404201 |
6 | 35135130112213 |
7 | 3442323205506 |
oct | 571360324361 |
9 | 154683514130 |
10 | 50663106801 |
11 | 1a539003aaa |
12 | 999ab7b669 |
13 | 4a15262708 |
14 | 26488234ad |
15 | 14b7bcad86 |
hex | bcbc1a8f1 |
50663106801 has 32 divisors (see below), whose sum is σ = 79506161280. Its totient is φ = 31774768128.
The previous prime is 50663106787. The next prime is 50663106829. The reversal of 50663106801 is 10860136605.
It is a happy number.
50663106801 is a `hidden beast` number, since 506 + 63 + 10 + 6 + 80 + 1 = 666.
It is not a de Polignac number, because 50663106801 - 27 = 50663106673 is a prime.
It is not an unprimeable number, because it can be changed into a prime (50663102801) 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 31 ways as a sum of consecutive naturals, for example, 1086570 + ... + 1132236.
It is an arithmetic number, because the mean of its divisors is an integer number (2484567540).
Almost surely, 250663106801 is an apocalyptic number.
50663106801 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
50663106801 is a deficient number, since it is larger than the sum of its proper divisors (28843054479).
50663106801 is a wasteful number, since it uses less digits than its factorization.
50663106801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48110 (or 48104 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
It can be divided in two parts, 50663 and 106801, that added together give a cube (157464 = 543).
The spelling of 50663106801 in words is "fifty billion, six hundred sixty-three million, one hundred six thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •