Base | Representation |
---|---|
bin | 11011111100000… |
… | …00110000110101 |
3 | 121022222201021212 |
4 | 31332000300311 |
5 | 434444003421 |
6 | 35131051205 |
7 | 5544011621 |
oct | 1576006065 |
9 | 538881255 |
10 | 234359861 |
11 | 11032103a |
12 | 665a0b05 |
13 | 39727898 |
14 | 231a8181 |
15 | 15894e5b |
hex | df80c35 |
234359861 has 2 divisors, whose sum is σ = 234359862. Its totient is φ = 234359860.
The previous prime is 234359849. The next prime is 234359893. The reversal of 234359861 is 168953432.
234359861 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., 201469636 + 32890225 = 14194^2 + 5735^2 .
It is a cyclic number.
It is not a de Polignac number, because 234359861 - 210 = 234358837 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is equal to p12868664 and since 234359861 and 12868664 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (234359561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 117179930 + 117179931.
It is an arithmetic number, because the mean of its divisors is an integer number (117179931).
Almost surely, 2234359861 is an apocalyptic number.
It is an amenable number.
234359861 is a deficient number, since it is larger than the sum of its proper divisors (1).
234359861 is an equidigital number, since it uses as much as digits as its factorization.
234359861 is an evil number, because the sum of its binary digits is even.
The product of its digits is 155520, while the sum is 41.
The square root of 234359861 is about 15308.8164467407. The cubic root of 234359861 is about 616.5397432800.
The spelling of 234359861 in words is "two hundred thirty-four million, three hundred fifty-nine thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •