Base | Representation |
---|---|
bin | 11011100000000… |
… | …10100111011001 |
3 | 121002002122101101 |
4 | 31300002213121 |
5 | 433024304213 |
6 | 34520351401 |
7 | 5500616161 |
oct | 1560024731 |
9 | 532078341 |
10 | 230697433 |
11 | 10924a43a |
12 | 65315561 |
13 | 38a44875 |
14 | 228d35a1 |
15 | 153bebdd |
hex | dc029d9 |
230697433 has 4 divisors (see below), whose sum is σ = 232981668. Its totient is φ = 228413200.
The previous prime is 230697427. The next prime is 230697461. The reversal of 230697433 is 334796032.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 202692169 + 28005264 = 14237^2 + 5292^2 .
It is a cyclic number.
It is not a de Polignac number, because 230697433 - 217 = 230566361 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230697392 and 230697401.
It is not an unprimeable number, because it can be changed into a prime (230697413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1141966 + ... + 1142167.
It is an arithmetic number, because the mean of its divisors is an integer number (58245417).
Almost surely, 2230697433 is an apocalyptic number.
It is an amenable number.
230697433 is a deficient number, since it is larger than the sum of its proper divisors (2284235).
230697433 is a wasteful number, since it uses less digits than its factorization.
230697433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2284234.
The product of its (nonzero) digits is 81648, while the sum is 37.
The square root of 230697433 is about 15188.7271685286. The cubic root of 230697433 is about 613.3112353871.
The spelling of 230697433 in words is "two hundred thirty million, six hundred ninety-seven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •