Base | Representation |
---|---|
bin | 11011011100000… |
… | …10001000000101 |
3 | 121001002220110002 |
4 | 31232002020011 |
5 | 432410434031 |
6 | 34501211045 |
7 | 5463264614 |
oct | 1556021005 |
9 | 531086402 |
10 | 230171141 |
11 | 108a1aa92 |
12 | 65100a85 |
13 | 388bc155 |
14 | 227d787b |
15 | 15318ccb |
hex | db82205 |
230171141 has 4 divisors (see below), whose sum is σ = 230556000. Its totient is φ = 229786284.
The previous prime is 230171129. The next prime is 230171153. The reversal of 230171141 is 141171032.
It is a happy number.
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 (230171129) and next prime (230171153).
It is a cyclic number.
It is not a de Polignac number, because 230171141 - 26 = 230171077 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 (230171341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 191531 + ... + 192728.
It is an arithmetic number, because the mean of its divisors is an integer number (57639000).
Almost surely, 2230171141 is an apocalyptic number.
It is an amenable number.
230171141 is a deficient number, since it is larger than the sum of its proper divisors (384859).
230171141 is an equidigital number, since it uses as much as digits as its factorization.
230171141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 384858.
The product of its (nonzero) digits is 168, while the sum is 20.
The square root of 230171141 is about 15171.3921905671. The cubic root of 230171141 is about 612.8444962500.
The spelling of 230171141 in words is "two hundred thirty million, one hundred seventy-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •