Base | Representation |
---|---|
bin | 11100110111000… |
… | …11000011001101 |
3 | 121212120002011102 |
4 | 32123203003031 |
5 | 443434234402 |
6 | 40005032445 |
7 | 5666560061 |
oct | 1633430315 |
9 | 555502142 |
10 | 242102477 |
11 | 11472a1a1 |
12 | 690b5725 |
13 | 3b208b06 |
14 | 24221aa1 |
15 | 163c4102 |
hex | e6e30cd |
242102477 has 4 divisors (see below), whose sum is σ = 242136636. Its totient is φ = 242068320.
The previous prime is 242102447. The next prime is 242102489. The reversal of 242102477 is 774201242.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 74891716 + 167210761 = 8654^2 + 12931^2 .
It is a cyclic number.
It is not a de Polignac number, because 242102477 - 214 = 242086093 is a prime.
It is a super-2 number, since 2×2421024772 = 117227218739071058, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (242102447) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2024 + ... + 22097.
It is an arithmetic number, because the mean of its divisors is an integer number (60534159).
Almost surely, 2242102477 is an apocalyptic number.
It is an amenable number.
242102477 is a deficient number, since it is larger than the sum of its proper divisors (34159).
242102477 is a wasteful number, since it uses less digits than its factorization.
242102477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34158.
The product of its (nonzero) digits is 6272, while the sum is 29.
The square root of 242102477 is about 15559.6425730156. The cubic root of 242102477 is about 623.2559179851.
The spelling of 242102477 in words is "two hundred forty-two million, one hundred two thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.497 sec. • engine limits •