Base | Representation |
---|---|
bin | 11011111011100… |
… | …11010100001101 |
3 | 121022212220201212 |
4 | 31331303110031 |
5 | 434440223111 |
6 | 35125544205 |
7 | 5543362214 |
oct | 1575632415 |
9 | 538786655 |
10 | 234304781 |
11 | 110293717 |
12 | 66575065 |
13 | 397087a9 |
14 | 2319207b |
15 | 1588398b |
hex | df7350d |
234304781 has 2 divisors, whose sum is σ = 234304782. Its totient is φ = 234304780.
The previous prime is 234304723. The next prime is 234304793. The reversal of 234304781 is 187403432.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 192959881 + 41344900 = 13891^2 + 6430^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-234304781 is a prime.
It is a super-2 number, since 2×2343047812 = 109797460798915922, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (234304481) 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 as a sum of consecutive naturals, namely, 117152390 + 117152391.
It is an arithmetic number, because the mean of its divisors is an integer number (117152391).
Almost surely, 2234304781 is an apocalyptic number.
It is an amenable number.
234304781 is a deficient number, since it is larger than the sum of its proper divisors (1).
234304781 is an equidigital number, since it uses as much as digits as its factorization.
234304781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 32.
The square root of 234304781 is about 15307.0173776605. The cubic root of 234304781 is about 616.4914391184.
The spelling of 234304781 in words is "two hundred thirty-four million, three hundred four thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •