Base | Representation |
---|---|
bin | 100101110111011101001… |
… | …1000010100101111000101 |
3 | 200102112021212110011221012 |
4 | 1023232322120110233011 |
5 | 1140231433034142041 |
6 | 15022500503332005 |
7 | 1045000130641442 |
oct | 113567230245705 |
9 | 20375255404835 |
10 | 5204332334021 |
11 | 1727165a203a7 |
12 | 700774451005 |
13 | 2b99c6b140a2 |
14 | 13dc68daa9c9 |
15 | 9059b1b53eb |
hex | 4bbba614bc5 |
5204332334021 has 2 divisors, whose sum is σ = 5204332334022. Its totient is φ = 5204332334020.
The previous prime is 5204332334017. The next prime is 5204332334029. The reversal of 5204332334021 is 1204332334025.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4621270281796 + 583062052225 = 2149714^2 + 763585^2 .
It is a cyclic number.
It is not a de Polignac number, because 5204332334021 - 22 = 5204332334017 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5204332334029) 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, 2602166167010 + 2602166167011.
It is an arithmetic number, because the mean of its divisors is an integer number (2602166167011).
Almost surely, 25204332334021 is an apocalyptic number.
It is an amenable number.
5204332334021 is a deficient number, since it is larger than the sum of its proper divisors (1).
5204332334021 is an equidigital number, since it uses as much as digits as its factorization.
5204332334021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 32.
Adding to 5204332334021 its reverse (1204332334025), we get a palindrome (6408664668046).
The spelling of 5204332334021 in words is "five trillion, two hundred four billion, three hundred thirty-two million, three hundred thirty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •