Base | Representation |
---|---|
bin | 11100111001100… |
… | …11000001010001 |
3 | 121220011201111010 |
4 | 32130303001101 |
5 | 444030230113 |
6 | 40020041133 |
7 | 6002423046 |
oct | 1634630121 |
9 | 556151433 |
10 | 242430033 |
11 | 1149332aa |
12 | 692331a9 |
13 | 3b2c1c31 |
14 | 242a91cd |
15 | 1643b1c3 |
hex | e733051 |
242430033 has 4 divisors (see below), whose sum is σ = 323240048. Its totient is φ = 161620020.
The previous prime is 242430029. The next prime is 242430073. The reversal of 242430033 is 330034242.
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 not a de Polignac number, because 242430033 - 22 = 242430029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 242429991 and 242430009.
It is not an unprimeable number, because it can be changed into a prime (242430073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40405003 + ... + 40405008.
It is an arithmetic number, because the mean of its divisors is an integer number (80810012).
Almost surely, 2242430033 is an apocalyptic number.
It is an amenable number.
242430033 is a deficient number, since it is larger than the sum of its proper divisors (80810015).
242430033 is an equidigital number, since it uses as much as digits as its factorization.
242430033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80810014.
The product of its (nonzero) digits is 1728, while the sum is 21.
The square root of 242430033 is about 15570.1648353510. The cubic root of 242430033 is about 623.5368723112.
Adding to 242430033 its reverse (330034242), we get a palindrome (572464275).
The spelling of 242430033 in words is "two hundred forty-two million, four hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •