Base | Representation |
---|---|
bin | 11011011110101… |
… | …01101001111101 |
3 | 121001202021202210 |
4 | 31233111221331 |
5 | 433002411102 |
6 | 34512411033 |
7 | 5466221241 |
oct | 1557255175 |
9 | 531667683 |
10 | 230513277 |
11 | 109134045 |
12 | 65246a79 |
13 | 389abab7 |
14 | 22886421 |
15 | 1538536c |
hex | dbd5a7d |
230513277 has 4 divisors (see below), whose sum is σ = 307351040. Its totient is φ = 153675516.
The previous prime is 230513267. The next prime is 230513287. The reversal of 230513277 is 772315032.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (230513267) and next prime (230513287).
It is not a de Polignac number, because 230513277 - 220 = 229464701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230513237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38418877 + ... + 38418882.
It is an arithmetic number, because the mean of its divisors is an integer number (76837760).
Almost surely, 2230513277 is an apocalyptic number.
It is an amenable number.
230513277 is a deficient number, since it is larger than the sum of its proper divisors (76837763).
230513277 is an equidigital number, since it uses as much as digits as its factorization.
230513277 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76837762.
The product of its (nonzero) digits is 8820, while the sum is 30.
The square root of 230513277 is about 15182.6636991010. The cubic root of 230513277 is about 613.1479984744.
The spelling of 230513277 in words is "two hundred thirty million, five hundred thirteen thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •