Base | Representation |
---|---|
bin | 1110000101100001011… |
… | …0011101101110111111 |
3 | 212010122102112201222211 |
4 | 3201120112131232333 |
5 | 12431104103440133 |
6 | 303101245321251 |
7 | 23324665622653 |
oct | 3413026355677 |
9 | 763572481884 |
10 | 242000452543 |
11 | 936a4a45903 |
12 | 3aa99566227 |
13 | 19a88976a65 |
14 | b9da224a63 |
15 | 64658acbcd |
hex | 385859dbbf |
242000452543 has 4 divisors (see below), whose sum is σ = 247628370088. Its totient is φ = 236372535000.
The previous prime is 242000452483. The next prime is 242000452559. The reversal of 242000452543 is 345254000242.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 345254000242 = 2 ⋅172627000121.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-242000452543 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (242000452643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2813958708 + ... + 2813958793.
It is an arithmetic number, because the mean of its divisors is an integer number (61907092522).
Almost surely, 2242000452543 is an apocalyptic number.
242000452543 is a deficient number, since it is larger than the sum of its proper divisors (5627917545).
242000452543 is an equidigital number, since it uses as much as digits as its factorization.
242000452543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5627917544.
The product of its (nonzero) digits is 38400, while the sum is 31.
Adding to 242000452543 its reverse (345254000242), we get a palindrome (587254452785).
The spelling of 242000452543 in words is "two hundred forty-two billion, four hundred fifty-two thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •