Base | Representation |
---|---|
bin | 11011011110110… |
… | …00110000111101 |
3 | 121001202221020111 |
4 | 31233120300331 |
5 | 433003313023 |
6 | 34512550021 |
7 | 5466303334 |
oct | 1557306075 |
9 | 531687214 |
10 | 230526013 |
11 | 109142673 |
12 | 65252311 |
13 | 389b4833 |
14 | 2288ad1b |
15 | 1538900d |
hex | dbd8c3d |
230526013 has 4 divisors (see below), whose sum is σ = 237962368. Its totient is φ = 223089660.
The previous prime is 230526007. The next prime is 230526019. The reversal of 230526013 is 310625032.
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 (230526007) and next prime (230526019).
It is a cyclic number.
It is not a de Polignac number, because 230526013 - 213 = 230517821 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 (230526019) 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, 3718131 + ... + 3718192.
It is an arithmetic number, because the mean of its divisors is an integer number (59490592).
Almost surely, 2230526013 is an apocalyptic number.
It is an amenable number.
230526013 is a deficient number, since it is larger than the sum of its proper divisors (7436355).
230526013 is an equidigital number, since it uses as much as digits as its factorization.
230526013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7436354.
The product of its (nonzero) digits is 1080, while the sum is 22.
The square root of 230526013 is about 15183.0831190506. The cubic root of 230526013 is about 613.1592905341.
The spelling of 230526013 in words is "two hundred thirty million, five hundred twenty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •