Base | Representation |
---|---|
bin | 10110011001000101… |
… | …100001111110011101 |
3 | 2022001121112010112012 |
4 | 112121011201332131 |
5 | 343220024403123 |
6 | 15013441121005 |
7 | 1510545555131 |
oct | 263105417635 |
9 | 68047463465 |
10 | 24043200413 |
11 | a21883a371 |
12 | 47b0029165 |
13 | 236224380b |
14 | 12412833c1 |
15 | 95abc6378 |
hex | 599161f9d |
24043200413 has 8 divisors (see below), whose sum is σ = 24174574200. Its totient is φ = 23912120320.
The previous prime is 24043200409. The next prime is 24043200421. The reversal of 24043200413 is 31400234042.
It can be written as a sum of positive squares in 4 ways, for example, as 22748783929 + 1294416484 = 150827^2 + 35978^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 24043200413 - 22 = 24043200409 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 (24043200403) 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 7 ways as a sum of consecutive naturals, for example, 91763 + ... + 237711.
It is an arithmetic number, because the mean of its divisors is an integer number (3021821775).
Almost surely, 224043200413 is an apocalyptic number.
It is an amenable number.
24043200413 is a deficient number, since it is larger than the sum of its proper divisors (131373787).
24043200413 is a wasteful number, since it uses less digits than its factorization.
24043200413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146847.
The product of its (nonzero) digits is 2304, while the sum is 23.
Adding to 24043200413 its reverse (31400234042), we get a palindrome (55443434455).
The spelling of 24043200413 in words is "twenty-four billion, forty-three million, two hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •