Base | Representation |
---|---|
bin | 11100010111110… |
… | …11011101011101 |
3 | 121120212001210221 |
4 | 32023323131131 |
5 | 441412230112 |
6 | 35341201341 |
7 | 5620015222 |
oct | 1613733535 |
9 | 546761727 |
10 | 238008157 |
11 | 112393062 |
12 | 67860251 |
13 | 3a40433a |
14 | 23877949 |
15 | 15d65e07 |
hex | e2fb75d |
238008157 has 4 divisors (see below), whose sum is σ = 243813276. Its totient is φ = 232203040.
The previous prime is 238008137. The next prime is 238008167. The reversal of 238008157 is 751800832.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5171076 + 232837081 = 2274^2 + 15259^2 .
It is a cyclic number.
It is not a de Polignac number, because 238008157 - 215 = 237975389 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 (238008137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2902498 + ... + 2902579.
It is an arithmetic number, because the mean of its divisors is an integer number (60953319).
Almost surely, 2238008157 is an apocalyptic number.
It is an amenable number.
238008157 is a deficient number, since it is larger than the sum of its proper divisors (5805119).
238008157 is an equidigital number, since it uses as much as digits as its factorization.
238008157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5805118.
The product of its (nonzero) digits is 13440, while the sum is 34.
The square root of 238008157 is about 15427.5129881650. The cubic root of 238008157 is about 619.7225232516.
Adding to 238008157 its reverse (751800832), we get a palindrome (989808989).
The spelling of 238008157 in words is "two hundred thirty-eight million, eight thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •