Base | Representation |
---|---|
bin | 11011011110001… |
… | …00110010110111 |
3 | 121001121210000221 |
4 | 31233010302313 |
5 | 432443203330 |
6 | 34511115211 |
7 | 5465513011 |
oct | 1557046267 |
9 | 531553027 |
10 | 230444215 |
11 | 109097171 |
12 | 65212b07 |
13 | 38986531 |
14 | 228691b1 |
15 | 1536eb7a |
hex | dbc4cb7 |
230444215 has 4 divisors (see below), whose sum is σ = 276533064. Its totient is φ = 184355368.
The previous prime is 230444213. The next prime is 230444233. The reversal of 230444215 is 512444032.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 230444215 - 21 = 230444213 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 230444215.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230444213) 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, 23044417 + ... + 23044426.
It is an arithmetic number, because the mean of its divisors is an integer number (69133266).
Almost surely, 2230444215 is an apocalyptic number.
230444215 is a deficient number, since it is larger than the sum of its proper divisors (46088849).
230444215 is an equidigital number, since it uses as much as digits as its factorization.
230444215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46088848.
The product of its (nonzero) digits is 3840, while the sum is 25.
The square root of 230444215 is about 15180.3891583846. The cubic root of 230444215 is about 613.0867591144.
Adding to 230444215 its reverse (512444032), we get a palindrome (742888247).
The spelling of 230444215 in words is "two hundred thirty million, four hundred forty-four thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •