Base | Representation |
---|---|
bin | 100100111011010100110… |
… | …1011100101111110110001 |
3 | 122222011222122010011112022 |
4 | 1021312221223211332301 |
5 | 1131123004001410331 |
6 | 14443303253041225 |
7 | 1032446160010412 |
oct | 111665153457661 |
9 | 18864878104468 |
10 | 5075203153841 |
11 | 1687421963077 |
12 | 69b737326215 |
13 | 2aa78848a172 |
14 | 1378d9423809 |
15 | 8c03ea1767b |
hex | 49da9ae5fb1 |
5075203153841 has 2 divisors, whose sum is σ = 5075203153842. Its totient is φ = 5075203153840.
The previous prime is 5075203153789. The next prime is 5075203153879. The reversal of 5075203153841 is 1483513025705.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5040204601600 + 34998552241 = 2245040^2 + 187079^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5075203153841 is a prime.
It is a super-2 number, since 2×50752031538412 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5075203153792 and 5075203153801.
It is not a weakly prime, because it can be changed into another prime (5075203156841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2537601576920 + 2537601576921.
It is an arithmetic number, because the mean of its divisors is an integer number (2537601576921).
Almost surely, 25075203153841 is an apocalyptic number.
It is an amenable number.
5075203153841 is a deficient number, since it is larger than the sum of its proper divisors (1).
5075203153841 is an equidigital number, since it uses as much as digits as its factorization.
5075203153841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504000, while the sum is 44.
The spelling of 5075203153841 in words is "five trillion, seventy-five billion, two hundred three million, one hundred fifty-three thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •