Base | Representation |
---|---|
bin | 1110000101111010001… |
… | …1100100010001100101 |
3 | 212010220200102110112202 |
4 | 3201132203210101211 |
5 | 12431312231104001 |
6 | 303115444424245 |
7 | 23330401503362 |
oct | 3413643442145 |
9 | 763820373482 |
10 | 242104550501 |
11 | 93748786180 |
12 | 3ab083a8085 |
13 | 19aa43c3898 |
14 | ba09da1469 |
15 | 646eac196b |
hex | 385e8e4465 |
242104550501 has 4 divisors (see below), whose sum is σ = 264114055104. Its totient is φ = 220095045900.
The previous prime is 242104550483. The next prime is 242104550507. The reversal of 242104550501 is 105055401242.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-242104550501 is a prime.
It is a super-2 number, since 2×2421045505012 (a number of 24 digits) 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 (242104550507) 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, 11004752285 + ... + 11004752306.
It is an arithmetic number, because the mean of its divisors is an integer number (66028513776).
Almost surely, 2242104550501 is an apocalyptic number.
It is an amenable number.
242104550501 is a deficient number, since it is larger than the sum of its proper divisors (22009504603).
242104550501 is a wasteful number, since it uses less digits than its factorization.
242104550501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22009504602.
The product of its (nonzero) digits is 8000, while the sum is 29.
Adding to 242104550501 its reverse (105055401242), we get a palindrome (347159951743).
The spelling of 242104550501 in words is "two hundred forty-two billion, one hundred four million, five hundred fifty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •