Base | Representation |
---|---|
bin | 110001101100101000… |
… | …110011001110001001 |
3 | 12002201220110210011200 |
4 | 301230220303032021 |
5 | 1333241213224231 |
6 | 40303030014413 |
7 | 3566236401564 |
oct | 615450631611 |
9 | 162656423150 |
10 | 53362242441 |
11 | 206a365a612 |
12 | a412aa7409 |
13 | 50555058b1 |
14 | 28230ad4db |
15 | 15c4b3ebe6 |
hex | c6ca33389 |
53362242441 has 12 divisors (see below), whose sum is σ = 77424442368. Its totient is φ = 35415298584.
The previous prime is 53362242407. The next prime is 53362242457. The reversal of 53362242441 is 14424226335.
53362242441 is a `hidden beast` number, since 5 + 3 + 3 + 622 + 4 + 24 + 4 + 1 = 666.
It is not a de Polignac number, because 53362242441 - 26 = 53362242377 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 53362242396 and 53362242405.
It is not an unprimeable number, because it can be changed into a prime (53362242481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13292025 + ... + 13296038.
It is an arithmetic number, because the mean of its divisors is an integer number (6452036864).
Almost surely, 253362242441 is an apocalyptic number.
It is an amenable number.
53362242441 is a deficient number, since it is larger than the sum of its proper divisors (24062199927).
53362242441 is a wasteful number, since it uses less digits than its factorization.
53362242441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26588292 (or 26588289 counting only the distinct ones).
The product of its digits is 138240, while the sum is 36.
Adding to 53362242441 its reverse (14424226335), we get a palindrome (67786468776).
The spelling of 53362242441 in words is "fifty-three billion, three hundred sixty-two million, two hundred forty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •