Base | Representation |
---|---|
bin | 11111111101111… |
… | …110101011111001 |
3 | 1101101012221212102 |
4 | 133331332223321 |
5 | 2044300404431 |
6 | 125115353145 |
7 | 16201553042 |
oct | 3775765371 |
9 | 1341187772 |
10 | 536341241 |
11 | 255829127 |
12 | 12b7527b5 |
13 | 8716a4a7 |
14 | 513358c9 |
15 | 32145dcb |
hex | 1ff7eaf9 |
536341241 has 4 divisors (see below), whose sum is σ = 536426484. Its totient is φ = 536256000.
The previous prime is 536341217. The next prime is 536341243. The reversal of 536341241 is 142143635.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 500819641 + 35521600 = 22379^2 + 5960^2 .
It is a cyclic number.
It is not a de Polignac number, because 536341241 - 226 = 469232377 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (536341243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32360 + ... + 46041.
It is an arithmetic number, because the mean of its divisors is an integer number (134106621).
Almost surely, 2536341241 is an apocalyptic number.
It is an amenable number.
536341241 is a deficient number, since it is larger than the sum of its proper divisors (85243).
536341241 is an equidigital number, since it uses as much as digits as its factorization.
536341241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85242.
The product of its digits is 8640, while the sum is 29.
The square root of 536341241 is about 23159.0423161235. The cubic root of 536341241 is about 812.4819674420.
Adding to 536341241 its reverse (142143635), we get a palindrome (678484876).
The spelling of 536341241 in words is "five hundred thirty-six million, three hundred forty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •