Base | Representation |
---|---|
bin | 11011011100010… |
… | …00000111100001 |
3 | 121001011011002222 |
4 | 31232020013201 |
5 | 432412230211 |
6 | 34501520425 |
7 | 5463426302 |
oct | 1556100741 |
9 | 531134088 |
10 | 230195681 |
11 | 108a37471 |
12 | 65113115 |
13 | 388ca381 |
14 | 228027a9 |
15 | 153211db |
hex | db881e1 |
230195681 has 4 divisors (see below), whose sum is σ = 230422164. Its totient is φ = 229969200.
The previous prime is 230195633. The next prime is 230195723. The reversal of 230195681 is 186591032.
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 79299025 + 150896656 = 8905^2 + 12284^2 .
It is a cyclic number.
It is not a de Polignac number, because 230195681 - 26 = 230195617 is a prime.
It is a super-2 number, since 2×2301956812 = 105980103102107522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230195281) 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, 111710 + ... + 113751.
It is an arithmetic number, because the mean of its divisors is an integer number (57605541).
Almost surely, 2230195681 is an apocalyptic number.
It is an amenable number.
230195681 is a deficient number, since it is larger than the sum of its proper divisors (226483).
230195681 is a wasteful number, since it uses less digits than its factorization.
230195681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226482.
The product of its (nonzero) digits is 12960, while the sum is 35.
The square root of 230195681 is about 15172.2009280130. The cubic root of 230195681 is about 612.8662752177.
The spelling of 230195681 in words is "two hundred thirty million, one hundred ninety-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •