Base | Representation |
---|---|
bin | 110010000010001001100101… |
… | …1000110010101100101000111 |
3 | 2010201021011022210201021100121 |
4 | 1210010103023012111211013 |
5 | 430141100014234311011 |
6 | 4200003111411322411 |
7 | 161462120103501532 |
oct | 14404231306254507 |
9 | 2121234283637317 |
10 | 440100116322631 |
11 | 118258458306776 |
12 | 4143a4265b0407 |
13 | 15b753557620bb |
14 | 7a96d603c3a19 |
15 | 35d30323b0e71 |
hex | 19044cb195947 |
440100116322631 has 2 divisors, whose sum is σ = 440100116322632. Its totient is φ = 440100116322630.
The previous prime is 440100116322499. The next prime is 440100116322637. The reversal of 440100116322631 is 136223611001044.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-440100116322631 is a prime.
It is a super-3 number, since 3×4401001163226313 (a number of 45 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (440100116322637) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 220050058161315 + 220050058161316.
It is an arithmetic number, because the mean of its divisors is an integer number (220050058161316).
Almost surely, 2440100116322631 is an apocalyptic number.
440100116322631 is a deficient number, since it is larger than the sum of its proper divisors (1).
440100116322631 is an equidigital number, since it uses as much as digits as its factorization.
440100116322631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 34.
Adding to 440100116322631 its reverse (136223611001044), we get a palindrome (576323727323675).
The spelling of 440100116322631 in words is "four hundred forty trillion, one hundred billion, one hundred sixteen million, three hundred twenty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •