Base | Representation |
---|---|
bin | 11111111110101… |
… | …011000100100001 |
3 | 1101101120012020202 |
4 | 133332223010201 |
5 | 2044322214131 |
6 | 125123314545 |
7 | 16203241055 |
oct | 3776530441 |
9 | 1341505222 |
10 | 536523041 |
11 | 25594277a |
12 | 12b81ba55 |
13 | 87202172 |
14 | 51381c65 |
15 | 3217ebcb |
hex | 1ffab121 |
536523041 has 2 divisors, whose sum is σ = 536523042. Its totient is φ = 536523040.
The previous prime is 536523037. The next prime is 536523079. The reversal of 536523041 is 140325635.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 280395025 + 256128016 = 16745^2 + 16004^2 .
It is a cyclic number.
It is not a de Polignac number, because 536523041 - 22 = 536523037 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 536522995 and 536523013.
It is not a weakly prime, because it can be changed into another prime (536520041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 268261520 + 268261521.
It is an arithmetic number, because the mean of its divisors is an integer number (268261521).
Almost surely, 2536523041 is an apocalyptic number.
It is an amenable number.
536523041 is a deficient number, since it is larger than the sum of its proper divisors (1).
536523041 is an equidigital number, since it uses as much as digits as its factorization.
536523041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 536523041 is about 23162.9670163388. The cubic root of 536523041 is about 812.5737575961.
Adding to 536523041 its reverse (140325635), we get a palindrome (676848676).
The spelling of 536523041 in words is "five hundred thirty-six million, five hundred twenty-three thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •