Base | Representation |
---|---|
bin | 1001111010010110… |
… | …01111001110101001 |
3 | 111201212000020110002 |
4 | 10331023033032221 |
5 | 41344224322213 |
6 | 2240010232345 |
7 | 245603334326 |
oct | 47513171651 |
9 | 14655006402 |
10 | 5321323433 |
11 | 2290826068 |
12 | 10461256b5 |
13 | 66a5b42ba |
14 | 386a25b4d |
15 | 212278658 |
hex | 13d2cf3a9 |
5321323433 has 2 divisors, whose sum is σ = 5321323434. Its totient is φ = 5321323432.
The previous prime is 5321323411. The next prime is 5321323489. The reversal of 5321323433 is 3343231235.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3198694249 + 2122629184 = 56557^2 + 46072^2 .
It is a cyclic number.
It is not a de Polignac number, because 5321323433 - 28 = 5321323177 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5321323396 and 5321323405.
It is not a weakly prime, because it can be changed into another prime (5321325433) 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, 2660661716 + 2660661717.
It is an arithmetic number, because the mean of its divisors is an integer number (2660661717).
Almost surely, 25321323433 is an apocalyptic number.
It is an amenable number.
5321323433 is a deficient number, since it is larger than the sum of its proper divisors (1).
5321323433 is an equidigital number, since it uses as much as digits as its factorization.
5321323433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 19440, while the sum is 29.
The square root of 5321323433 is about 72947.4018248765. The cubic root of 5321323433 is about 1745.8484920496.
Adding to 5321323433 its reverse (3343231235), we get a palindrome (8664554668).
The spelling of 5321323433 in words is "five billion, three hundred twenty-one million, three hundred twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •