Base | Representation |
---|---|
bin | 101101111110… |
… | …0001000100101 |
3 | 1200100110220221 |
4 | 1123330020211 |
5 | 22132221123 |
6 | 2220324341 |
7 | 411600340 |
oct | 133741045 |
9 | 50313827 |
10 | 24101413 |
11 | 12671826 |
12 | 80a36b1 |
13 | 4cbb1bb |
14 | 32b5457 |
15 | 21b125d |
hex | 16fc225 |
24101413 has 4 divisors (see below), whose sum is σ = 27544480. Its totient is φ = 20658348.
The previous prime is 24101383. The next prime is 24101423. The reversal of 24101413 is 31410142.
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: 31410142 = 2 ⋅15705071.
It is a cyclic number.
It is not a de Polignac number, because 24101413 - 25 = 24101381 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (24101423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1721523 + ... + 1721536.
It is an arithmetic number, because the mean of its divisors is an integer number (6886120).
Almost surely, 224101413 is an apocalyptic number.
It is an amenable number.
24101413 is a deficient number, since it is larger than the sum of its proper divisors (3443067).
24101413 is an equidigital number, since it uses as much as digits as its factorization.
24101413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3443066.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 24101413 is about 4909.3189955431. The cubic root of 24101413 is about 288.8556288522.
Adding to 24101413 its reverse (31410142), we get a palindrome (55511555).
The spelling of 24101413 in words is "twenty-four million, one hundred one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •