Base | Representation |
---|---|
bin | 11011011010111… |
… | …11110010110001 |
3 | 121000211202112122 |
4 | 31231133302301 |
5 | 432341434023 |
6 | 34454204025 |
7 | 5462140616 |
oct | 1555376261 |
9 | 530752478 |
10 | 230030513 |
11 | 108934369 |
12 | 65053615 |
13 | 3887013b |
14 | 2279c50d |
15 | 152dc2c8 |
hex | db5fcb1 |
230030513 has 4 divisors (see below), whose sum is σ = 230077248. Its totient is φ = 229983780.
The previous prime is 230030503. The next prime is 230030527. The reversal of 230030513 is 315030032.
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 a cyclic number.
It is not a de Polignac number, because 230030513 - 28 = 230030257 is a prime.
It is a super-2 number, since 2×2300305132 = 105828073822086338, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 230030491 and 230030500.
It is not an unprimeable number, because it can be changed into a prime (230030503) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14981 + ... + 26162.
It is an arithmetic number, because the mean of its divisors is an integer number (57519312).
Almost surely, 2230030513 is an apocalyptic number.
It is an amenable number.
230030513 is a deficient number, since it is larger than the sum of its proper divisors (46735).
230030513 is an equidigital number, since it uses as much as digits as its factorization.
230030513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46734.
The product of its (nonzero) digits is 270, while the sum is 17.
The square root of 230030513 is about 15166.7568385598. The cubic root of 230030513 is about 612.7196606557.
Adding to 230030513 its reverse (315030032), we get a palindrome (545060545).
The spelling of 230030513 in words is "two hundred thirty million, thirty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •