Base | Representation |
---|---|
bin | 11100011101010… |
… | …11001100100001 |
3 | 121122012122012122 |
4 | 32032223030201 |
5 | 442103243334 |
6 | 35404434025 |
7 | 5626103624 |
oct | 1616531441 |
9 | 548178178 |
10 | 238727969 |
11 | 112834947 |
12 | 67b48915 |
13 | 3a5c6b6c |
14 | 239c3dbb |
15 | 15e5932e |
hex | e3ab321 |
238727969 has 2 divisors, whose sum is σ = 238727970. Its totient is φ = 238727968.
The previous prime is 238727963. The next prime is 238727977. The reversal of 238727969 is 969727832.
238727969 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 197767969 + 40960000 = 14063^2 + 6400^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-238727969 is a prime.
It is a super-2 number, since 2×2387279692 = 113982086365729922, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 238727969.
It is not a weakly prime, because it can be changed into another prime (238727963) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 119363984 + 119363985.
It is an arithmetic number, because the mean of its divisors is an integer number (119363985).
Almost surely, 2238727969 is an apocalyptic number.
It is an amenable number.
238727969 is a deficient number, since it is larger than the sum of its proper divisors (1).
238727969 is an equidigital number, since it uses as much as digits as its factorization.
238727969 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2286144, while the sum is 53.
The square root of 238727969 is about 15450.8242174973. The cubic root of 238727969 is about 620.3466401854.
The spelling of 238727969 in words is "two hundred thirty-eight million, seven hundred twenty-seven thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •