Base | Representation |
---|---|
bin | 100010010011011… |
… | …011110110000011 |
3 | 1111002221110012102 |
4 | 202103123312003 |
5 | 2134313121011 |
6 | 133035221015 |
7 | 20155561154 |
oct | 4223336603 |
9 | 1432843172 |
10 | 575520131 |
11 | 27595887a |
12 | 1408a776b |
13 | 92307374 |
14 | 5661392b |
15 | 357d473b |
hex | 224dbd83 |
575520131 has 2 divisors, whose sum is σ = 575520132. Its totient is φ = 575520130.
The previous prime is 575520097. The next prime is 575520133. The reversal of 575520131 is 131025575.
It is a happy number.
575520131 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 is a cyclic number.
It is not a de Polignac number, because 575520131 - 26 = 575520067 is a prime.
It is a super-2 number, since 2×5755201312 = 662446842372514322, which contains 22 as substring.
Together with 575520133, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 575520094 and 575520103.
It is not a weakly prime, because it can be changed into another prime (575520133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 287760065 + 287760066.
It is an arithmetic number, because the mean of its divisors is an integer number (287760066).
Almost surely, 2575520131 is an apocalyptic number.
575520131 is a deficient number, since it is larger than the sum of its proper divisors (1).
575520131 is an equidigital number, since it uses as much as digits as its factorization.
575520131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5250, while the sum is 29.
The square root of 575520131 is about 23990.0006461025. Note that the first 3 decimals coincide. The cubic root of 575520131 is about 831.8024076778.
The spelling of 575520131 in words is "five hundred seventy-five million, five hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •