Base | Representation |
---|---|
bin | 100100100100011011111… |
… | …1000100111110000111011 |
3 | 122210111010000112000002012 |
4 | 1021020313320213300323 |
5 | 1124321322111414024 |
6 | 14404534000000135 |
7 | 1026056121244322 |
oct | 111106770476073 |
9 | 18714100460065 |
10 | 5026049326139 |
11 | 16685988a7876 |
12 | 6920b990004b |
13 | 2a5c53b1840a |
14 | 13539523b0b9 |
15 | 8ab145ba50e |
hex | 49237e27c3b |
5026049326139 has 2 divisors, whose sum is σ = 5026049326140. Its totient is φ = 5026049326138.
The previous prime is 5026049326063. The next prime is 5026049326211. The reversal of 5026049326139 is 9316239406205.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5026049326139 - 232 = 5021754358843 is a prime.
It is a super-2 number, since 2×50260493261392 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (5026049326439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2513024663069 + 2513024663070.
It is an arithmetic number, because the mean of its divisors is an integer number (2513024663070).
Almost surely, 25026049326139 is an apocalyptic number.
5026049326139 is a deficient number, since it is larger than the sum of its proper divisors (1).
5026049326139 is an equidigital number, since it uses as much as digits as its factorization.
5026049326139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2099520, while the sum is 50.
The spelling of 5026049326139 in words is "five trillion, twenty-six billion, forty-nine million, three hundred twenty-six thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •