Base | Representation |
---|---|
bin | 101111000111111111… |
… | …110111110110110101 |
3 | 11211121101220212121200 |
4 | 233013333313312311 |
5 | 1312112103100401 |
6 | 35124554403113 |
7 | 3440626220646 |
oct | 570777676665 |
9 | 154541825550 |
10 | 50600050101 |
11 | 1a506455627 |
12 | 9981a30499 |
13 | 4a05185363 |
14 | 26402cb6cd |
15 | 14b23c2686 |
hex | bc7ff7db5 |
50600050101 has 12 divisors (see below), whose sum is σ = 73402650828. Its totient is φ = 33588586944.
The previous prime is 50600050099. The next prime is 50600050139. The reversal of 50600050101 is 10105000605.
50600050101 is a `hidden beast` number, since 5 + 0 + 600 + 0 + 50 + 10 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 15462922500 + 35137127601 = 124350^2 + 187449^2 .
It is not a de Polignac number, because 50600050101 - 21 = 50600050099 is a prime.
It is a super-2 number, since 2×506000501012 (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 (50600050901) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12062770 + ... + 12066963.
It is an arithmetic number, because the mean of its divisors is an integer number (6116887569).
Almost surely, 250600050101 is an apocalyptic number.
It is an amenable number.
50600050101 is a deficient number, since it is larger than the sum of its proper divisors (22802600727).
50600050101 is a wasteful number, since it uses less digits than its factorization.
50600050101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24129972 (or 24129969 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
Adding to 50600050101 its reverse (10105000605), we get a palindrome (60705050706).
The spelling of 50600050101 in words is "fifty billion, six hundred million, fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •