Base | Representation |
---|---|
bin | 10110100100111000… |
… | …111011100101001101 |
3 | 2022120102010202211121 |
4 | 112210320323211031 |
5 | 344121223132023 |
6 | 15045233320541 |
7 | 1515502001326 |
oct | 264470734515 |
9 | 68512122747 |
10 | 24241224013 |
11 | a30a5a2436 |
12 | 4846406151 |
13 | 2394288346 |
14 | 125d6ad44d |
15 | 96d28ed5d |
hex | 5a4e3b94d |
24241224013 has 4 divisors (see below), whose sum is σ = 24242776668. Its totient is φ = 24239671360.
The previous prime is 24241224011. The next prime is 24241224031. The reversal of 24241224013 is 31042214242.
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 13886736964 + 10354487049 = 117842^2 + 101757^2 .
It is a cyclic number.
It is not a de Polignac number, because 24241224013 - 21 = 24241224011 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 (24241224011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 752668 + ... + 784213.
It is an arithmetic number, because the mean of its divisors is an integer number (6060694167).
Almost surely, 224241224013 is an apocalyptic number.
It is an amenable number.
24241224013 is a deficient number, since it is larger than the sum of its proper divisors (1552655).
24241224013 is a wasteful number, since it uses less digits than its factorization.
24241224013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1552654.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 24241224013 its reverse (31042214242), we get a palindrome (55283438255).
The spelling of 24241224013 in words is "twenty-four billion, two hundred forty-one million, two hundred twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •