Base | Representation |
---|---|
bin | 11100111100110… |
… | …11001111000101 |
3 | 121220222102001001 |
4 | 32132123033011 |
5 | 444132410101 |
6 | 40033133301 |
7 | 6006151420 |
oct | 1636331705 |
9 | 556872031 |
10 | 242856901 |
11 | 1150a4a91 |
12 | 693ba231 |
13 | 3b411311 |
14 | 2437a9b7 |
15 | 164c2901 |
hex | e79b3c5 |
242856901 has 4 divisors (see below), whose sum is σ = 277550752. Its totient is φ = 208163052.
The previous prime is 242856877. The next prime is 242856919. The reversal of 242856901 is 109658242.
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, and also an emirpimes, since its reverse is a distinct semiprime: 109658242 = 2 ⋅54829121.
It is a cyclic number.
It is not a de Polignac number, because 242856901 - 25 = 242856869 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 (242856941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17346915 + ... + 17346928.
It is an arithmetic number, because the mean of its divisors is an integer number (69387688).
Almost surely, 2242856901 is an apocalyptic number.
It is an amenable number.
242856901 is a deficient number, since it is larger than the sum of its proper divisors (34693851).
242856901 is an equidigital number, since it uses as much as digits as its factorization.
242856901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34693850.
The product of its (nonzero) digits is 34560, while the sum is 37.
The square root of 242856901 is about 15583.8666896249. The cubic root of 242856901 is about 623.9026298938.
The spelling of 242856901 in words is "two hundred forty-two million, eight hundred fifty-six thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •