Base | Representation |
---|---|
bin | 100111000100… |
… | …110110000101 |
3 | 201021102101110 |
4 | 213010312011 |
5 | 10110242321 |
6 | 1003315233 |
7 | 153032214 |
oct | 47046605 |
9 | 21242343 |
10 | 10243461 |
11 | 5867078 |
12 | 351bb19 |
13 | 2178627 |
14 | 150907b |
15 | d75176 |
hex | 9c4d85 |
10243461 has 4 divisors (see below), whose sum is σ = 13657952. Its totient is φ = 6828972.
The previous prime is 10243459. The next prime is 10243463. The reversal of 10243461 is 16434201.
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 (10243459) and next prime (10243463).
It is not a de Polignac number, because 10243461 - 21 = 10243459 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10243463) 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, 1707241 + ... + 1707246.
It is an arithmetic number, because the mean of its divisors is an integer number (3414488).
Almost surely, 210243461 is an apocalyptic number.
It is an amenable number.
10243461 is a deficient number, since it is larger than the sum of its proper divisors (3414491).
10243461 is an equidigital number, since it uses as much as digits as its factorization.
10243461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3414490.
The product of its (nonzero) digits is 576, while the sum is 21.
The square root of 10243461 is about 3200.5407355633. The cubic root of 10243461 is about 217.1778716743.
Adding to 10243461 its reverse (16434201), we get a palindrome (26677662).
The spelling of 10243461 in words is "ten million, two hundred forty-three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •