Base | Representation |
---|---|
bin | 11100111010001… |
… | …11010111001000 |
3 | 121220022221210000 |
4 | 32131013113020 |
5 | 444040411402 |
6 | 40021523000 |
7 | 6003221004 |
oct | 1635072710 |
9 | 556287700 |
10 | 242513352 |
11 | 11498a964 |
12 | 69273460 |
13 | 3b320b33 |
14 | 242cb704 |
15 | 16455c1c |
hex | e7475c8 |
242513352 has 80 divisors (see below), whose sum is σ = 682323840. Its totient is φ = 80473824.
The previous prime is 242513333. The next prime is 242513353. The reversal of 242513352 is 253315242.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (242513353) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 169713 + ... + 171135.
It is an arithmetic number, because the mean of its divisors is an integer number (8529048).
Almost surely, 2242513352 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 242513352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (341161920).
242513352 is an abundant number, since it is smaller than the sum of its proper divisors (439810488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
242513352 is a wasteful number, since it uses less digits than its factorization.
242513352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1704 (or 1691 counting only the distinct ones).
The product of its digits is 7200, while the sum is 27.
The square root of 242513352 is about 15572.8402033797. The cubic root of 242513352 is about 623.6082970675.
Adding to 242513352 its reverse (253315242), we get a palindrome (495828594).
The spelling of 242513352 in words is "two hundred forty-two million, five hundred thirteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •