Base | Representation |
---|---|
bin | 11011111011110… |
… | …10011110000001 |
3 | 121022221101221001 |
4 | 31331322132001 |
5 | 434442142311 |
6 | 35130332001 |
7 | 5543543512 |
oct | 1575723601 |
9 | 538841831 |
10 | 234334081 |
11 | 110303733 |
12 | 6658a001 |
13 | 39718c27 |
14 | 2319ca09 |
15 | 1588c4c1 |
hex | df7a781 |
234334081 has 2 divisors, whose sum is σ = 234334082. Its totient is φ = 234334080.
The previous prime is 234334013. The next prime is 234334109. The reversal of 234334081 is 180433432.
It is an a-pointer prime, because the next prime (234334109) can be obtained adding 234334081 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 232257600 + 2076481 = 15240^2 + 1441^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-234334081 is a prime.
It is a super-2 number, since 2×2343340812 = 109824923036229122, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (234334381) 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, 117167040 + 117167041.
It is an arithmetic number, because the mean of its divisors is an integer number (117167041).
Almost surely, 2234334081 is an apocalyptic number.
It is an amenable number.
234334081 is a deficient number, since it is larger than the sum of its proper divisors (1).
234334081 is an equidigital number, since it uses as much as digits as its factorization.
234334081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 28.
The square root of 234334081 is about 15307.9744251158. The cubic root of 234334081 is about 616.5171356296.
The spelling of 234334081 in words is "two hundred thirty-four million, three hundred thirty-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •