Base | Representation |
---|---|
bin | 11011011110010… |
… | …01110011000111 |
3 | 121001122211011001 |
4 | 31233021303013 |
5 | 432444332321 |
6 | 34511354131 |
7 | 5465626531 |
oct | 1557116307 |
9 | 531584131 |
10 | 230464711 |
11 | 109100604 |
12 | 65222947 |
13 | 38992969 |
14 | 22872851 |
15 | 15375c91 |
hex | dbc9cc7 |
230464711 has 4 divisors (see below), whose sum is σ = 238411800. Its totient is φ = 222517624.
The previous prime is 230464709. The next prime is 230464721. The reversal of 230464711 is 117464032.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 230464711 - 21 = 230464709 is a prime.
It is a super-2 number, since 2×2304647112 = 106227966032627042, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 230464711.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230464721) 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 in 3 ways as a sum of consecutive naturals, for example, 3973501 + ... + 3973558.
It is an arithmetic number, because the mean of its divisors is an integer number (59602950).
Almost surely, 2230464711 is an apocalyptic number.
230464711 is a deficient number, since it is larger than the sum of its proper divisors (7947089).
230464711 is an equidigital number, since it uses as much as digits as its factorization.
230464711 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7947088.
The product of its (nonzero) digits is 4032, while the sum is 28.
The square root of 230464711 is about 15181.0642248823. The cubic root of 230464711 is about 613.1049348128.
The spelling of 230464711 in words is "two hundred thirty million, four hundred sixty-four thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •