Base | Representation |
---|---|
bin | 101110101110101001101100… |
… | …0011110101010010001100011 |
3 | 1222220100021102221121010011001 |
4 | 1131131103120132222101203 |
5 | 412333322020022041311 |
6 | 4014105254531332431 |
7 | 152402040120634252 |
oct | 13535233036522143 |
9 | 1886307387533131 |
10 | 411032002143331 |
11 | 109a7076969a548 |
12 | 3a124909a51117 |
13 | 148471c7a8199a |
14 | 73700ab0c0799 |
15 | 327bd440994c1 |
hex | 175d4d87aa463 |
411032002143331 has 2 divisors, whose sum is σ = 411032002143332. Its totient is φ = 411032002143330.
The previous prime is 411032002143317. The next prime is 411032002143361. The reversal of 411032002143331 is 133341200230114.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 411032002143331 - 25 = 411032002143299 is a prime.
It is a super-2 number, since 2×4110320021433312 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 411032002143331.
It is not a weakly prime, because it can be changed into another prime (411032002143361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 205516001071665 + 205516001071666.
It is an arithmetic number, because the mean of its divisors is an integer number (205516001071666).
Almost surely, 2411032002143331 is an apocalyptic number.
411032002143331 is a deficient number, since it is larger than the sum of its proper divisors (1).
411032002143331 is an equidigital number, since it uses as much as digits as its factorization.
411032002143331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 411032002143331 its reverse (133341200230114), we get a palindrome (544373202373445).
The spelling of 411032002143331 in words is "four hundred eleven trillion, thirty-two billion, two million, one hundred forty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •