Base | Representation |
---|---|
bin | 101110100100010011… |
… | …110100111000001001 |
3 | 11210001200021021021002 |
4 | 232210103310320021 |
5 | 1304400313113001 |
6 | 34545325224345 |
7 | 3420036021521 |
oct | 564423647011 |
9 | 153050237232 |
10 | 50001301001 |
11 | 1a229481563 |
12 | 98354020b5 |
13 | 493b106c52 |
14 | 25c498c681 |
15 | 1479a5046b |
hex | ba44f4e09 |
50001301001 has 4 divisors (see below), whose sum is σ = 50074510032. Its totient is φ = 49928091972.
The previous prime is 50001300977. The next prime is 50001301069. The reversal of 50001301001 is 10010310005.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50001301001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50001301081) 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 3 ways as a sum of consecutive naturals, for example, 36603491 + ... + 36604856.
It is an arithmetic number, because the mean of its divisors is an integer number (12518627508).
Almost surely, 250001301001 is an apocalyptic number.
It is an amenable number.
50001301001 is a deficient number, since it is larger than the sum of its proper divisors (73209031).
50001301001 is an equidigital number, since it uses as much as digits as its factorization.
50001301001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73209030.
The product of its (nonzero) digits is 15, while the sum is 11.
Adding to 50001301001 its reverse (10010310005), we get a palindrome (60011611006).
The spelling of 50001301001 in words is "fifty billion, one million, three hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •