Base | Representation |
---|---|
bin | 11100111011000… |
… | …10101011001111 |
3 | 121220112122020200 |
4 | 32131202223033 |
5 | 444103001411 |
6 | 40024144543 |
7 | 6004165122 |
oct | 1635425317 |
9 | 556478220 |
10 | 242625231 |
11 | 114a56a22 |
12 | 69308153 |
13 | 3b35ca34 |
14 | 2431a3b9 |
15 | 16478e56 |
hex | e762acf |
242625231 has 24 divisors (see below), whose sum is σ = 371754240. Its totient is φ = 152053200.
The previous prime is 242625217. The next prime is 242625259. The reversal of 242625231 is 132526242.
It is a happy number.
242625231 is a `hidden beast` number, since 2 + 4 + 2 + 625 + 2 + 31 = 666.
It is not a de Polignac number, because 242625231 - 215 = 242592463 is a prime.
It is a super-2 number, since 2×2426252312 = 117734005435606722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 242625195 and 242625204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (242625211) 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 23 ways as a sum of consecutive naturals, for example, 16986 + ... + 27816.
It is an arithmetic number, because the mean of its divisors is an integer number (15489760).
Almost surely, 2242625231 is an apocalyptic number.
242625231 is a deficient number, since it is larger than the sum of its proper divisors (129129009).
242625231 is a wasteful number, since it uses less digits than its factorization.
242625231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10987 (or 10984 counting only the distinct ones).
The product of its digits is 5760, while the sum is 27.
The square root of 242625231 is about 15576.4319084956. The cubic root of 242625231 is about 623.7041790001.
The spelling of 242625231 in words is "two hundred forty-two million, six hundred twenty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •