Base | Representation |
---|---|
bin | 11011011101110… |
… | …10000011100111 |
3 | 121001112112200220 |
4 | 31232322003213 |
5 | 432440301411 |
6 | 34510135423 |
7 | 5465240535 |
oct | 1556720347 |
9 | 531475626 |
10 | 230400231 |
11 | 109067116 |
12 | 651b1573 |
13 | 3896c4c9 |
14 | 22857155 |
15 | 15361b06 |
hex | dbba0e7 |
230400231 has 8 divisors (see below), whose sum is σ = 307307760. Its totient is φ = 153546432.
The previous prime is 230400193. The next prime is 230400253. The reversal of 230400231 is 132004032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 230400231 - 210 = 230399207 is a prime.
It is a super-2 number, since 2×2304002312 = 106168532889706722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 230400231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230401231) 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 7 ways as a sum of consecutive naturals, for example, 2046 + ... + 21563.
It is an arithmetic number, because the mean of its divisors is an integer number (38413470).
Almost surely, 2230400231 is an apocalyptic number.
230400231 is a deficient number, since it is larger than the sum of its proper divisors (76907529).
230400231 is a wasteful number, since it uses less digits than its factorization.
230400231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26865.
The product of its (nonzero) digits is 144, while the sum is 15.
The square root of 230400231 is about 15178.9403780369. The cubic root of 230400231 is about 613.0477507961.
Adding to 230400231 its reverse (132004032), we get a palindrome (362404263).
The spelling of 230400231 in words is "two hundred thirty million, four hundred thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •