Base | Representation |
---|---|
bin | 1001011001000001… |
… | …01110100100000101 |
3 | 111000100221010202012 |
4 | 10230200232210011 |
5 | 40311141303013 |
6 | 2152142024005 |
7 | 235640055326 |
oct | 45440564405 |
9 | 14010833665 |
10 | 5041744133 |
11 | 2157a29a98 |
12 | b88578005 |
13 | 6246b626a |
14 | 35b84a44d |
15 | 1e79501a8 |
hex | 12c82e905 |
5041744133 has 2 divisors, whose sum is σ = 5041744134. Its totient is φ = 5041744132.
The previous prime is 5041744007. The next prime is 5041744181. The reversal of 5041744133 is 3314471405.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2672683204 + 2369060929 = 51698^2 + 48673^2 .
It is a cyclic number.
It is not a de Polignac number, because 5041744133 - 212 = 5041740037 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5041744133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5041744193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2520872066 + 2520872067.
It is an arithmetic number, because the mean of its divisors is an integer number (2520872067).
Almost surely, 25041744133 is an apocalyptic number.
It is an amenable number.
5041744133 is a deficient number, since it is larger than the sum of its proper divisors (1).
5041744133 is an equidigital number, since it uses as much as digits as its factorization.
5041744133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 32.
The square root of 5041744133 is about 71005.2401798628. The cubic root of 5041744133 is about 1714.7215286200.
The spelling of 5041744133 in words is "five billion, forty-one million, seven hundred forty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •