Base | Representation |
---|---|
bin | 10110101001000100… |
… | …101101010010001001 |
3 | 2022202022020002200111 |
4 | 112221010231102021 |
5 | 344242210420131 |
6 | 15100222034321 |
7 | 1520313442426 |
oct | 265104552211 |
9 | 68668202614 |
10 | 24311420041 |
11 | a346187787 |
12 | 4865a189a1 |
13 | 23a599515c |
14 | 1268b42d4d |
15 | 974508ab1 |
hex | 5a912d489 |
24311420041 has 4 divisors (see below), whose sum is σ = 25149744900. Its totient is φ = 23473095184.
The previous prime is 24311419973. The next prime is 24311420101. The reversal of 24311420041 is 14002411342.
It is a happy number.
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 12347654400 + 11963765641 = 111120^2 + 109379^2 .
It is a cyclic number.
It is not a de Polignac number, because 24311420041 - 225 = 24277865609 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 24311419994 and 24311420021.
It is not an unprimeable number, because it can be changed into a prime (24311420941) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 419162386 + ... + 419162443.
It is an arithmetic number, because the mean of its divisors is an integer number (6287436225).
Almost surely, 224311420041 is an apocalyptic number.
It is an amenable number.
24311420041 is a deficient number, since it is larger than the sum of its proper divisors (838324859).
24311420041 is an equidigital number, since it uses as much as digits as its factorization.
24311420041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 838324858.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 24311420041 its reverse (14002411342), we get a palindrome (38313831383).
The spelling of 24311420041 in words is "twenty-four billion, three hundred eleven million, four hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •