Base | Representation |
---|---|
bin | 101101111111001010111001… |
… | …1111101001110111000001110 |
3 | 1222001020102100210002120001001 |
4 | 1123332111303331032320032 |
5 | 411004412310121224032 |
6 | 3552151335521010514 |
7 | 151126420135535026 |
oct | 13376256375167016 |
9 | 1861212323076031 |
10 | 404506260336142 |
11 | 107985161559988 |
12 | 39450034183a3a |
13 | 14492a13481263 |
14 | 71c62c93c6a86 |
15 | 31b720962b3e7 |
hex | 16fe573f4ee0e |
404506260336142 has 16 divisors (see below), whose sum is σ = 658120658856192. Its totient is φ = 185713060698880.
The previous prime is 404506260336121. The next prime is 404506260336149. The reversal of 404506260336142 is 241633062605404.
It is a happy number.
It is a super-2 number, since 2×4045062603361422 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 404506260336092 and 404506260336101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404506260336149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 145088327278 + ... + 145088330065.
It is an arithmetic number, because the mean of its divisors is an integer number (41132541178512).
Almost surely, 2404506260336142 is an apocalyptic number.
404506260336142 is a deficient number, since it is larger than the sum of its proper divisors (253614398520050).
404506260336142 is a wasteful number, since it uses less digits than its factorization.
404506260336142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290176657403.
The product of its (nonzero) digits is 2488320, while the sum is 46.
The spelling of 404506260336142 in words is "four hundred four trillion, five hundred six billion, two hundred sixty million, three hundred thirty-six thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •