Base | Representation |
---|---|
bin | 1001011101000100… |
… | …11000010110111101 |
3 | 111002201212220012102 |
4 | 10232202120112331 |
5 | 40343341410101 |
6 | 2155354314445 |
7 | 236532003122 |
oct | 45642302675 |
9 | 14081786172 |
10 | 5075731901 |
11 | 2175133559 |
12 | b97a28a25 |
13 | 62b756376 |
14 | 362176749 |
15 | 1ea91586b |
hex | 12e8985bd |
5075731901 has 8 divisors (see below), whose sum is σ = 5132352120. Its totient is φ = 5019199488.
The previous prime is 5075731889. The next prime is 5075731907. The reversal of 5075731901 is 1091375705.
It can be written as a sum of positive squares in 4 ways, for example, as 3332752900 + 1742979001 = 57730^2 + 41749^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5075731901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5075731907) 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 7 ways as a sum of consecutive naturals, for example, 97925 + ... + 140501.
It is an arithmetic number, because the mean of its divisors is an integer number (641544015).
Almost surely, 25075731901 is an apocalyptic number.
It is an amenable number.
5075731901 is a deficient number, since it is larger than the sum of its proper divisors (56620219).
5075731901 is a wasteful number, since it uses less digits than its factorization.
5075731901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43903.
The product of its (nonzero) digits is 33075, while the sum is 38.
The square root of 5075731901 is about 71244.1709966507. The cubic root of 5075731901 is about 1718.5660372389.
The spelling of 5075731901 in words is "five billion, seventy-five million, seven hundred thirty-one thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •