Base | Representation |
---|---|
bin | 101110100100100101… |
… | …111100010100110101 |
3 | 11210002000012112210200 |
4 | 232210211330110311 |
5 | 1304403022100401 |
6 | 34550015111113 |
7 | 3420124261350 |
oct | 564445742465 |
9 | 153060175720 |
10 | 50006050101 |
11 | 1a231125637 |
12 | 9836b12499 |
13 | 493c0aa777 |
14 | 25c5467297 |
15 | 147a18c686 |
hex | ba497c535 |
50006050101 has 24 divisors (see below), whose sum is σ = 82584587904. Its totient is φ = 28562798880.
The previous prime is 50006050097. The next prime is 50006050147. The reversal of 50006050101 is 10105060005.
50006050101 is a `hidden beast` number, since 50 + 0 + 0 + 605 + 0 + 10 + 1 = 666.
It is not a de Polignac number, because 50006050101 - 22 = 50006050097 is a prime.
It is a super-2 number, since 2×500060501012 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50006050901) 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 23 ways as a sum of consecutive naturals, for example, 16681 + ... + 316686.
It is an arithmetic number, because the mean of its divisors is an integer number (3441024496).
Almost surely, 250006050101 is an apocalyptic number.
It is an amenable number.
50006050101 is a deficient number, since it is larger than the sum of its proper divisors (32578537803).
50006050101 is a wasteful number, since it uses less digits than its factorization.
50006050101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335761 (or 335758 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The spelling of 50006050101 in words is "fifty billion, six million, fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •