Base | Representation |
---|---|
bin | 11110000110101… |
… | …11110101111011 |
3 | 122121012110221200 |
4 | 33003113311323 |
5 | 1004122323311 |
6 | 41020505243 |
7 | 6154401006 |
oct | 1703276573 |
9 | 577173850 |
10 | 252542331 |
11 | 11a60a878 |
12 | 706ab223 |
13 | 40422942 |
14 | 2577c53d |
15 | 17287556 |
hex | f0d7d7b |
252542331 has 12 divisors (see below), whose sum is σ = 366173808. Its totient is φ = 167719824.
The previous prime is 252542317. The next prime is 252542341. The reversal of 252542331 is 133245252.
It is a happy number.
It is not a de Polignac number, because 252542331 - 27 = 252542203 is a prime.
It is a super-2 number, since 2×2525423312 = 127555257893827122, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 252542295 and 252542304.
It is not an unprimeable number, because it can be changed into a prime (252542341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 50980 + ... + 55713.
It is an arithmetic number, because the mean of its divisors is an integer number (30514484).
Almost surely, 2252542331 is an apocalyptic number.
252542331 is a deficient number, since it is larger than the sum of its proper divisors (113631477).
252542331 is a wasteful number, since it uses less digits than its factorization.
252542331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106962 (or 106959 counting only the distinct ones).
The product of its digits is 7200, while the sum is 27.
The square root of 252542331 is about 15891.5805066708. The cubic root of 252542331 is about 632.0887511892.
Adding to 252542331 its reverse (133245252), we get a palindrome (385787583).
The spelling of 252542331 in words is "two hundred fifty-two million, five hundred forty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.186 sec. • engine limits •