10229641 has 4 divisors (see below), whose sum is σ = 10674432. Its totient is φ = 9784852.

The previous prime is 10229629. The next prime is 10229647. The reversal of 10229641 is 14692201.

10229641 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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, and also an emirpimes, since its reverse is a distinct semiprime: 14692201 = 971 ⋅15131.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-10229641 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (10229647) 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, 222361 + ... + 222406.

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

Almost surely, 2^10229641 is an apocalyptic number.

It is an amenable number.

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

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

10229641 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 444790.

The product of its (nonzero) digits is 864, while the sum is 25.

The square root of 10229641 is about 3198.3809966919. The cubic root of 10229641 is about 217.0801589650.

The spelling of 10229641 in words is "ten million, two hundred twenty-nine thousand, six hundred forty-one".