Base | Representation |
---|---|
bin | 101101111100101100011101… |
… | …1100101000010101001111111 |
3 | 1222000000220010021220221220212 |
4 | 1123321120323211002221333 |
5 | 410433323443041213033 |
6 | 3551331145215303035 |
7 | 151063013360053343 |
oct | 13371307345025177 |
9 | 1860026107827825 |
10 | 404166012054143 |
11 | 107863930244709 |
12 | 393b60b781aa7b |
13 | 144698cb00c691 |
14 | 71b3a4cb27623 |
15 | 31ad443790748 |
hex | 16f963b942a7f |
404166012054143 has 16 divisors (see below), whose sum is σ = 405442919962080. Its totient is φ = 402891091699200.
The previous prime is 404166012054053. The next prime is 404166012054163. The reversal of 404166012054143 is 341450210661404.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-404166012054143 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 404166012054143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404166012054163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9438478673 + ... + 9438521493.
It is an arithmetic number, because the mean of its divisors is an integer number (25340182497630).
Almost surely, 2404166012054143 is an apocalyptic number.
404166012054143 is a deficient number, since it is larger than the sum of its proper divisors (1276907907937).
404166012054143 is a wasteful number, since it uses less digits than its factorization.
404166012054143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65338.
The product of its (nonzero) digits is 276480, while the sum is 41.
The spelling of 404166012054143 in words is "four hundred four trillion, one hundred sixty-six billion, twelve million, fifty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •