Base | Representation |
---|---|
bin | 11111010010111… |
… | …000001001010101 |
3 | 1100120221220120200 |
4 | 133102320021111 |
5 | 2033402323021 |
6 | 124033251113 |
7 | 16003533312 |
oct | 3722701125 |
9 | 1316856520 |
10 | 525042261 |
11 | 24a411027 |
12 | 127a03a99 |
13 | 84a125c3 |
14 | 4da33d09 |
15 | 31163126 |
hex | 1f4b8255 |
525042261 has 6 divisors (see below), whose sum is σ = 758394390. Its totient is φ = 350028168.
The previous prime is 525042241. The next prime is 525042281. The reversal of 525042261 is 162240525.
It is an interprime number because it is at equal distance from previous prime (525042241) and next prime (525042281).
It can be written as a sum of positive squares in only one way, i.e., 393228900 + 131813361 = 19830^2 + 11481^2 .
It is not a de Polignac number, because 525042261 - 214 = 525025877 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (525042241) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 29169006 + ... + 29169023.
It is an arithmetic number, because the mean of its divisors is an integer number (126399065).
Almost surely, 2525042261 is an apocalyptic number.
It is an amenable number.
525042261 is a deficient number, since it is larger than the sum of its proper divisors (233352129).
525042261 is a wasteful number, since it uses less digits than its factorization.
525042261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58338035 (or 58338032 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The square root of 525042261 is about 22913.8006668470. The cubic root of 525042261 is about 806.7359684975.
Adding to 525042261 its reverse (162240525), we get a palindrome (687282786).
The spelling of 525042261 in words is "five hundred twenty-five million, forty-two thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •