Base | Representation |
---|---|
bin | 10110011100110010… |
… | …111111101001000111 |
3 | 2022012221122201222111 |
4 | 112130302333221013 |
5 | 343331443400210 |
6 | 15023543241451 |
7 | 1512232642021 |
oct | 263462775107 |
9 | 68187581874 |
10 | 24105450055 |
11 | a24a997455 |
12 | 4808a49287 |
13 | 23720ca71b |
14 | 1249649011 |
15 | 9613c088a |
hex | 59ccbfa47 |
24105450055 has 4 divisors (see below), whose sum is σ = 28926540072. Its totient is φ = 19284360040.
The previous prime is 24105450001. The next prime is 24105450059. The reversal of 24105450055 is 55005450142.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 55005450142 = 2 ⋅27502725071.
It is not a de Polignac number, because 24105450055 - 225 = 24071895623 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 24105449999 and 24105450026.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (24105450059) 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, 2410545001 + ... + 2410545010.
It is an arithmetic number, because the mean of its divisors is an integer number (7231635018).
Almost surely, 224105450055 is an apocalyptic number.
24105450055 is a deficient number, since it is larger than the sum of its proper divisors (4821090017).
24105450055 is an equidigital number, since it uses as much as digits as its factorization.
24105450055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4821090016.
The product of its (nonzero) digits is 20000, while the sum is 31.
The spelling of 24105450055 in words is "twenty-four billion, one hundred five million, four hundred fifty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •