Base | Representation |
---|---|
bin | 100010010010100… |
… | …111011011001101 |
3 | 1111002112112200012 |
4 | 202102213123031 |
5 | 2134234233141 |
6 | 133030443005 |
7 | 20154005165 |
oct | 4222473315 |
9 | 1432475605 |
10 | 575305421 |
11 | 275821529 |
12 | 140803465 |
13 | 92260712 |
14 | 565995a5 |
15 | 35790ceb |
hex | 224a76cd |
575305421 has 2 divisors, whose sum is σ = 575305422. Its totient is φ = 575305420.
The previous prime is 575305387. The next prime is 575305441. The reversal of 575305421 is 124503575.
575305421 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 540330025 + 34975396 = 23245^2 + 5914^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-575305421 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (575305441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 287652710 + 287652711.
It is an arithmetic number, because the mean of its divisors is an integer number (287652711).
Almost surely, 2575305421 is an apocalyptic number.
It is an amenable number.
575305421 is a deficient number, since it is larger than the sum of its proper divisors (1).
575305421 is an equidigital number, since it uses as much as digits as its factorization.
575305421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21000, while the sum is 32.
The square root of 575305421 is about 23985.5252391937. The cubic root of 575305421 is about 831.6989542973.
Adding to 575305421 its reverse (124503575), we get a palindrome (699808996).
The spelling of 575305421 in words is "five hundred seventy-five million, three hundred five thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •