Base | Representation |
---|---|

bin | 11111010000011100111 |

3 | 1221000222111 |

4 | 3322003213 |

5 | 230233411 |

6 | 33541451 |

7 | 11464045 |

oct | 3720347 |

9 | 1830874 |

10 | 1024231 |

11 | 63a57a |

12 | 414887 |

13 | 29b270 |

14 | 1c9395 |

15 | 153721 |

hex | fa0e7 |

1024231 has 4 divisors (see below), whose sum is σ = 1103032. Its totient is φ = 945432.

The previous prime is 1024207. The next prime is 1024249. The reversal of 1024231 is 1324201.

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 1024231 - 2^{7} = 1024103 is a prime.

It is a super-2 number, since 2×1024231^{2} = 2098098282722, which contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (13), and also a Moran number because the ratio is a prime number: 78787 = 1024231 / (1 + 0 + 2 + 4 + 2 + 3 + 1).

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1024031) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39381 + ... + 39406.

It is an arithmetic number, because the mean of its divisors is an integer number (275758).

2^{1024231} is an apocalyptic number.

1024231 is a deficient number, since it is larger than the sum of its proper divisors (78801).

1024231 is an equidigital number, since it uses as much as digits as its factorization.

1024231 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 78800.

The product of its (nonzero) digits is 48, while the sum is 13.

The square root of 1024231 is about 1012.0429832769. The cubic root of 1024231 is about 100.8012626343.

1024231 divided by its sum of digits (13) gives a palindrome (78787).

Adding to 1024231 its reverse (1324201), we get a palindrome (2348432).

The spelling of 1024231 in words is "one million, twenty-four thousand, two hundred thirty-one".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •