Base | Representation |
---|---|
bin | 10110011001001001… |
… | …001000011000000011 |
3 | 2022001200022002001201 |
4 | 112121021020120003 |
5 | 343220300103011 |
6 | 15013513242031 |
7 | 1510556565400 |
oct | 263111103003 |
9 | 68050262051 |
10 | 24044144131 |
11 | a2193243a7 |
12 | 47b0403317 |
13 | 23624b4227 |
14 | 124144b2a7 |
15 | 95ad10cc1 |
hex | 599248603 |
24044144131 has 6 divisors (see below), whose sum is σ = 27969718740. Its totient is φ = 20609266356.
The previous prime is 24044144083. The next prime is 24044144167. The reversal of 24044144131 is 13144144042.
It is not a de Polignac number, because 24044144131 - 29 = 24044143619 is a prime.
It is a super-2 number, since 2×240441441312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 24044144131.
It is not an unprimeable number, because it can be changed into a prime (24044114131) 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 5 ways as a sum of consecutive naturals, for example, 245348361 + ... + 245348458.
It is an arithmetic number, because the mean of its divisors is an integer number (4661619790).
Almost surely, 224044144131 is an apocalyptic number.
24044144131 is a deficient number, since it is larger than the sum of its proper divisors (3925574609).
24044144131 is an equidigital number, since it uses as much as digits as its factorization.
24044144131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 490696833 (or 490696826 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 24044144131 its reverse (13144144042), we get a palindrome (37188288173).
The spelling of 24044144131 in words is "twenty-four billion, forty-four million, one hundred forty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •