Base | Representation |
---|---|
bin | 11111111100110… |
… | …001100010011001 |
3 | 1101100121220101201 |
4 | 133330301202121 |
5 | 2044210301431 |
6 | 125104514201 |
7 | 16166065543 |
oct | 3774614231 |
9 | 1340556351 |
10 | 536025241 |
11 | 255632774 |
12 | 12b61b961 |
13 | 870896cb |
14 | 51292693 |
15 | 320d2461 |
hex | 1ff31899 |
536025241 has 8 divisors (see below), whose sum is σ = 558560520. Its totient is φ = 513760128.
The previous prime is 536025227. The next prime is 536025251. The reversal of 536025241 is 142520635.
It can be written as a sum of positive squares in 4 ways, for example, as 252810000 + 283215241 = 15900^2 + 16829^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 536025241 - 213 = 536017049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (536025251) 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 in 7 ways as a sum of consecutive naturals, for example, 63486 + ... + 71431.
It is an arithmetic number, because the mean of its divisors is an integer number (69820065).
Almost surely, 2536025241 is an apocalyptic number.
It is an amenable number.
536025241 is a deficient number, since it is larger than the sum of its proper divisors (22535279).
536025241 is a wasteful number, since it uses less digits than its factorization.
536025241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135083.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 536025241 is about 23152.2189217362. The cubic root of 536025241 is about 812.3223708263.
Adding to 536025241 its reverse (142520635), we get a palindrome (678545876).
The spelling of 536025241 in words is "five hundred thirty-six million, twenty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •