Base | Representation |
---|---|
bin | 11011011011110… |
… | …00110011011101 |
3 | 121001000222001212 |
4 | 31231320303131 |
5 | 432403223312 |
6 | 34500314205 |
7 | 5463045365 |
oct | 1555706335 |
9 | 531028055 |
10 | 230132957 |
11 | 1089a432a |
12 | 650a2965 |
13 | 388a7962 |
14 | 227c79a5 |
15 | 1530c822 |
hex | db78cdd |
230132957 has 2 divisors, whose sum is σ = 230132958. Its totient is φ = 230132956.
The previous prime is 230132941. The next prime is 230132971. The reversal of 230132957 is 759231032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 145106116 + 85026841 = 12046^2 + 9221^2 .
It is a cyclic number.
It is not a de Polignac number, because 230132957 - 24 = 230132941 is a prime.
It is a super-2 number, since 2×2301329572 = 105922355795127698, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230132977) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115066478 + 115066479.
It is an arithmetic number, because the mean of its divisors is an integer number (115066479).
Almost surely, 2230132957 is an apocalyptic number.
It is an amenable number.
230132957 is a deficient number, since it is larger than the sum of its proper divisors (1).
230132957 is an equidigital number, since it uses as much as digits as its factorization.
230132957 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 230132957 is about 15170.1337172749. The cubic root of 230132957 is about 612.8106053109.
Adding to 230132957 its reverse (759231032), we get a palindrome (989363989).
It can be divided in two parts, 230 and 132957, that multiplied together give a triangular number (30580110 = T7820).
The spelling of 230132957 in words is "two hundred thirty million, one hundred thirty-two thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •