Base | Representation |
---|---|
bin | 11100111100000… |
… | …01101111010101 |
3 | 121220210002210012 |
4 | 32132001233111 |
5 | 444121034334 |
6 | 40031010005 |
7 | 6005235101 |
oct | 1636015725 |
9 | 556702705 |
10 | 242752469 |
11 | 115033583 |
12 | 69369905 |
13 | 3b3a591b |
14 | 24350901 |
15 | 164a19ce |
hex | e781bd5 |
242752469 has 8 divisors (see below), whose sum is σ = 257444568. Its totient is φ = 228106240.
The previous prime is 242752451. The next prime is 242752553. The reversal of 242752469 is 964257242.
It can be written as a sum of positive squares in 4 ways, for example, as 162435025 + 80317444 = 12745^2 + 8962^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-242752469 is a prime.
It is a super-3 number, since 3×2427524693 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (242752429) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 242 + ... + 22035.
It is an arithmetic number, because the mean of its divisors is an integer number (32180571).
Almost surely, 2242752469 is an apocalyptic number.
It is an amenable number.
242752469 is a deficient number, since it is larger than the sum of its proper divisors (14692099).
242752469 is a wasteful number, since it uses less digits than its factorization.
242752469 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22935.
The product of its digits is 241920, while the sum is 41.
The square root of 242752469 is about 15580.5156846620. The cubic root of 242752469 is about 623.8131880035.
The spelling of 242752469 in words is "two hundred forty-two million, seven hundred fifty-two thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •