Base | Representation |
---|---|
bin | 11011110000000… |
… | …10000001001101 |
3 | 121020001001210011 |
4 | 31320002001031 |
5 | 434043322031 |
6 | 35033313221 |
7 | 5524462201 |
oct | 1570020115 |
9 | 536031704 |
10 | 232792141 |
11 | 10a4501aa |
12 | 65b65811 |
13 | 392c913a |
14 | 22cbab01 |
15 | 156856b1 |
hex | de0204d |
232792141 has 2 divisors, whose sum is σ = 232792142. Its totient is φ = 232792140.
The previous prime is 232792127. The next prime is 232792159. The reversal of 232792141 is 141297232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 211586116 + 21206025 = 14546^2 + 4605^2 .
It is a cyclic number.
It is not a de Polignac number, because 232792141 - 27 = 232792013 is a prime.
It is a super-2 number, since 2×2327921412 = 108384361822727762, which contains 22 as substring.
It is equal to p12787600 and since 232792141 and 12787600 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 (232792171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116396070 + 116396071.
It is an arithmetic number, because the mean of its divisors is an integer number (116396071).
Almost surely, 2232792141 is an apocalyptic number.
It is an amenable number.
232792141 is a deficient number, since it is larger than the sum of its proper divisors (1).
232792141 is an equidigital number, since it uses as much as digits as its factorization.
232792141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6048, while the sum is 31.
The square root of 232792141 is about 15257.5273553745. The cubic root of 232792141 is about 615.1619121141.
The spelling of 232792141 in words is "two hundred thirty-two million, seven hundred ninety-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •