Base | Representation |
---|---|
bin | 11011110000000… |
… | …01100111110001 |
3 | 121020000222112212 |
4 | 31320001213301 |
5 | 434043244023 |
6 | 35033301505 |
7 | 5524454354 |
oct | 1570014761 |
9 | 536028485 |
10 | 232790513 |
11 | 10a449a5a |
12 | 65b64895 |
13 | 392c8487 |
14 | 22cba29b |
15 | 15684e78 |
hex | de019f1 |
232790513 has 2 divisors, whose sum is σ = 232790514. Its totient is φ = 232790512.
The previous prime is 232790507. The next prime is 232790539. The reversal of 232790513 is 315097232.
232790513 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., 205406224 + 27384289 = 14332^2 + 5233^2 .
It is a cyclic number.
It is not a de Polignac number, because 232790513 - 212 = 232786417 is a prime.
It is equal to p12787511 and since 232790513 and 12787511 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 232790513.
It is not a weakly prime, because it can be changed into another prime (232790573) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 116395256 + 116395257.
It is an arithmetic number, because the mean of its divisors is an integer number (116395257).
Almost surely, 2232790513 is an apocalyptic number.
It is an amenable number.
232790513 is a deficient number, since it is larger than the sum of its proper divisors (1).
232790513 is an equidigital number, since it uses as much as digits as its factorization.
232790513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11340, while the sum is 32.
The square root of 232790513 is about 15257.4740045658. The cubic root of 232790513 is about 615.1604780939.
The spelling of 232790513 in words is "two hundred thirty-two million, seven hundred ninety thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •