Base | Representation |
---|---|
bin | 1011110001000111111… |
… | …10111101111100101101 |
3 | 1102122122111102102110200 |
4 | 11320203332331330231 |
5 | 23111032120310203 |
6 | 505425200424113 |
7 | 41132455456122 |
oct | 5704376757455 |
9 | 1378574372420 |
10 | 404330635053 |
11 | 146526114634 |
12 | 66441618039 |
13 | 2c1888c58a7 |
14 | 157d93c2749 |
15 | a7b6bce9a3 |
hex | 5e23fbdf2d |
404330635053 has 12 divisors (see below), whose sum is σ = 584245319580. Its totient is φ = 269455827456.
The previous prime is 404330635031. The next prime is 404330635057. The reversal of 404330635053 is 350536033404.
It can be written as a sum of positive squares in 2 ways, for example, as 239432105124 + 164898529929 = 489318^2 + 406077^2 .
It is not a de Polignac number, because 404330635053 - 221 = 404328537901 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 404330634999 and 404330635017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404330635057) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8134618 + ... + 8184171.
It is an arithmetic number, because the mean of its divisors is an integer number (48687109965).
Almost surely, 2404330635053 is an apocalyptic number.
It is an amenable number.
404330635053 is a deficient number, since it is larger than the sum of its proper divisors (179914684527).
404330635053 is a wasteful number, since it uses less digits than its factorization.
404330635053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16321548 (or 16321545 counting only the distinct ones).
The product of its (nonzero) digits is 194400, while the sum is 36.
Adding to 404330635053 its reverse (350536033404), we get a palindrome (754866668457).
The spelling of 404330635053 in words is "four hundred four billion, three hundred thirty million, six hundred thirty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •