Base | Representation |
---|---|
bin | 101110000000010100000010… |
… | …1101000100111000000011110 |
3 | 1222001210102202202122001120010 |
4 | 1130000220011220213000132 |
5 | 411020000441221214032 |
6 | 3552351433031504050 |
7 | 151143650246220231 |
oct | 13400500550470036 |
9 | 1861712682561503 |
10 | 404663323226142 |
11 | 107a3582a456902 |
12 | 39476568228026 |
13 | 144a4784085b66 |
14 | 71cdb48bc5418 |
15 | 31bb34d2e8ccc |
hex | 1700a05a2701e |
404663323226142 has 8 divisors (see below), whose sum is σ = 809326646452296. Its totient is φ = 134887774408712.
The previous prime is 404663323226119. The next prime is 404663323226147. The reversal of 404663323226142 is 241622323366404.
It is a sphenic number, since it is the product of 3 distinct primes.
404663323226142 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 404663323226091 and 404663323226100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404663323226147) 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, 33721943602173 + ... + 33721943602184.
It is an arithmetic number, because the mean of its divisors is an integer number (101165830806537).
Almost surely, 2404663323226142 is an apocalyptic number.
404663323226142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
404663323226142 is a wasteful number, since it uses less digits than its factorization.
404663323226142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67443887204362.
The product of its (nonzero) digits is 5971968, while the sum is 48.
The spelling of 404663323226142 in words is "four hundred four trillion, six hundred sixty-three billion, three hundred twenty-three million, two hundred twenty-six thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •