Base | Representation |
---|---|
bin | 100010001001101… |
… | …101000010110101 |
3 | 1110221010211220022 |
4 | 202021231002311 |
5 | 2133140003031 |
6 | 132504414525 |
7 | 20125104653 |
oct | 4211550265 |
9 | 1427124808 |
10 | 572969141 |
11 | 274476218 |
12 | 13ba77445 |
13 | 919231c4 |
14 | 5614bdd3 |
15 | 3547d97b |
hex | 2226d0b5 |
572969141 has 2 divisors, whose sum is σ = 572969142. Its totient is φ = 572969140.
The previous prime is 572969093. The next prime is 572969147. The reversal of 572969141 is 141969275.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 572597041 + 372100 = 23929^2 + 610^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-572969141 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 572969092 and 572969101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (572969147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 286484570 + 286484571.
It is an arithmetic number, because the mean of its divisors is an integer number (286484571).
Almost surely, 2572969141 is an apocalyptic number.
It is an amenable number.
572969141 is a deficient number, since it is larger than the sum of its proper divisors (1).
572969141 is an equidigital number, since it uses as much as digits as its factorization.
572969141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 136080, while the sum is 44.
The square root of 572969141 is about 23936.7738218833. The cubic root of 572969141 is about 830.5716007461.
The spelling of 572969141 in words is "five hundred seventy-two million, nine hundred sixty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •