Base | Representation |
---|---|
bin | 101110101010001100… |
… | …101111000100011101 |
3 | 11210022120012001120000 |
4 | 232222030233010131 |
5 | 1310101111334001 |
6 | 35003215044513 |
7 | 3422345604345 |
oct | 565214570435 |
9 | 153276161500 |
10 | 50100105501 |
11 | 1a27a226876 |
12 | 9862510739 |
13 | 495571c554 |
14 | 25d3b4bd25 |
15 | 148356aa86 |
hex | baa32f11d |
50100105501 has 20 divisors (see below), whose sum is σ = 75612465852. Its totient is φ = 33055734528.
The previous prime is 50100105481. The next prime is 50100105509. The reversal of 50100105501 is 10550100105.
50100105501 is a `hidden beast` number, since 5 + 0 + 100 + 10 + 550 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 25336362276 + 24763743225 = 159174^2 + 157365^2 .
It is not a de Polignac number, because 50100105501 - 210 = 50100104477 is a prime.
It is a super-2 number, since 2×501001055012 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50100105509) 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 19 ways as a sum of consecutive naturals, for example, 3180390 + ... + 3196103.
Almost surely, 250100105501 is an apocalyptic number.
It is an amenable number.
50100105501 is a deficient number, since it is larger than the sum of its proper divisors (25512360351).
50100105501 is an equidigital number, since it uses as much as digits as its factorization.
50100105501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6376602 (or 6376593 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 18.
Adding to 50100105501 its reverse (10550100105), we get a palindrome (60650205606).
The spelling of 50100105501 in words is "fifty billion, one hundred million, one hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •