Base | Representation |
---|---|
bin | 100100100100000110100… |
… | …0101101010010010111101 |
3 | 122210102020222110201102211 |
4 | 1021020031011222102331 |
5 | 1124313334304332333 |
6 | 14404334430420421 |
7 | 1026032252315023 |
oct | 111101505522275 |
9 | 18712228421384 |
10 | 5025331324093 |
11 | 166825a582253 |
12 | 691b39361711 |
13 | 2a5b6b145132 |
14 | 135327b38713 |
15 | 8aac153decd |
hex | 4920d16a4bd |
5025331324093 has 2 divisors, whose sum is σ = 5025331324094. Its totient is φ = 5025331324092.
The previous prime is 5025331324037. The next prime is 5025331324121. The reversal of 5025331324093 is 3904231335205.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4671036142564 + 354295181529 = 2161258^2 + 595227^2 .
It is a cyclic number.
It is not a de Polignac number, because 5025331324093 - 221 = 5025329226941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5025331324193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2512665662046 + 2512665662047.
It is an arithmetic number, because the mean of its divisors is an integer number (2512665662047).
Almost surely, 25025331324093 is an apocalyptic number.
It is an amenable number.
5025331324093 is a deficient number, since it is larger than the sum of its proper divisors (1).
5025331324093 is an equidigital number, since it uses as much as digits as its factorization.
5025331324093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 291600, while the sum is 40.
Adding to 5025331324093 its reverse (3904231335205), we get a palindrome (8929562659298).
The spelling of 5025331324093 in words is "five trillion, twenty-five billion, three hundred thirty-one million, three hundred twenty-four thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •