Base | Representation |
---|---|
bin | 11110000110101… |
… | …11110010110011 |
3 | 122121012110200021 |
4 | 33003113302303 |
5 | 1004122322011 |
6 | 41020504311 |
7 | 6154400302 |
oct | 1703276263 |
9 | 577173607 |
10 | 252542131 |
11 | 11a60a706 |
12 | 706ab097 |
13 | 4042281a |
14 | 2577c439 |
15 | 17287471 |
hex | f0d7cb3 |
252542131 has 4 divisors (see below), whose sum is σ = 259367632. Its totient is φ = 245716632.
The previous prime is 252542111. The next prime is 252542137. The reversal of 252542131 is 131245252.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 252542131 - 25 = 252542099 is a prime.
It is a super-2 number, since 2×2525421312 = 127555055860042322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 252542096 and 252542105.
It is not an unprimeable number, because it can be changed into a prime (252542137) 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 3 ways as a sum of consecutive naturals, for example, 3412695 + ... + 3412768.
It is an arithmetic number, because the mean of its divisors is an integer number (64841908).
Almost surely, 2252542131 is an apocalyptic number.
252542131 is a deficient number, since it is larger than the sum of its proper divisors (6825501).
252542131 is an equidigital number, since it uses as much as digits as its factorization.
252542131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6825500.
The product of its digits is 2400, while the sum is 25.
The square root of 252542131 is about 15891.5742140293. The cubic root of 252542131 is about 632.0885843290.
Adding to 252542131 its reverse (131245252), we get a palindrome (383787383).
The spelling of 252542131 in words is "two hundred fifty-two million, five hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •