Base | Representation |
---|---|
bin | 11100011110100… |
… | …10101100001101 |
3 | 121122111212010012 |
4 | 32033102230031 |
5 | 442123432431 |
6 | 35412123005 |
7 | 5630346356 |
oct | 1617225415 |
9 | 548455105 |
10 | 238889741 |
11 | 112935442 |
12 | 68006465 |
13 | 3a65269c |
14 | 23a26d2d |
15 | 15e8c22b |
hex | e3d2b0d |
238889741 has 8 divisors (see below), whose sum is σ = 241464960. Its totient is φ = 236321712.
The previous prime is 238889719. The next prime is 238889747. The reversal of 238889741 is 147988832.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 238889741 - 210 = 238888717 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 238889741.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (238889747) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 88376 + ... + 91038.
It is an arithmetic number, because the mean of its divisors is an integer number (30183120).
Almost surely, 2238889741 is an apocalyptic number.
It is an amenable number.
238889741 is a deficient number, since it is larger than the sum of its proper divisors (2575219).
238889741 is a wasteful number, since it uses less digits than its factorization.
238889741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3595.
The product of its digits is 774144, while the sum is 50.
The square root of 238889741 is about 15456.0583914528. The cubic root of 238889741 is about 620.4867327734.
Subtracting from 238889741 its reverse (147988832), we obtain a palindrome (90900909).
It can be divided in two parts, 2388 and 89741, that added together give a palindrome (92129).
The spelling of 238889741 in words is "two hundred thirty-eight million, eight hundred eighty-nine thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •