Base | Representation |
---|---|
bin | 101000100001… |
… | …110011110001 |
3 | 201222202201102 |
4 | 220201303301 |
5 | 10204433431 |
6 | 1015414145 |
7 | 156206315 |
oct | 50416361 |
9 | 21882642 |
10 | 10624241 |
11 | 5aa7171 |
12 | 3684355 |
13 | 227ca44 |
14 | 15a7b45 |
15 | decdcb |
hex | a21cf1 |
10624241 has 4 divisors (see below), whose sum is σ = 10654692. Its totient is φ = 10593792.
The previous prime is 10624223. The next prime is 10624247. The reversal of 10624241 is 14242601.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1600225 + 9024016 = 1265^2 + 3004^2 .
It is a cyclic number.
It is not a de Polignac number, because 10624241 - 222 = 6429937 is a prime.
It is a super-2 number, since 2×106242412 = 225748993652162, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10624247) 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, 14696 + ... + 15401.
It is an arithmetic number, because the mean of its divisors is an integer number (2663673).
Almost surely, 210624241 is an apocalyptic number.
It is an amenable number.
10624241 is a deficient number, since it is larger than the sum of its proper divisors (30451).
10624241 is an equidigital number, since it uses as much as digits as its factorization.
10624241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30450.
The product of its (nonzero) digits is 384, while the sum is 20.
The square root of 10624241 is about 3259.4847752367. The cubic root of 10624241 is about 219.8362486696.
Adding to 10624241 its reverse (14242601), we get a palindrome (24866842).
The spelling of 10624241 in words is "ten million, six hundred twenty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •