Base | Representation |
---|---|
bin | 1011111101110001010… |
… | …10110001011010101001 |
3 | 1110022011200000122201202 |
4 | 11332320222301122221 |
5 | 23213433222111241 |
6 | 512511014453545 |
7 | 41462640206321 |
oct | 5767052613251 |
9 | 1408150018652 |
10 | 411120113321 |
11 | 14939a64a0a5 |
12 | 678173642b5 |
13 | 2c9cb3cc358 |
14 | 15c80dbc281 |
15 | aa62cb1d9b |
hex | 5fb8ab16a9 |
411120113321 has 2 divisors, whose sum is σ = 411120113322. Its totient is φ = 411120113320.
The previous prime is 411120113311. The next prime is 411120113347. The reversal of 411120113321 is 123311021114.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 216229650025 + 194890463296 = 465005^2 + 441464^2 .
It is a cyclic number.
It is not a de Polignac number, because 411120113321 - 210 = 411120112297 is a prime.
It is a super-3 number, since 3×4111201133213 (a number of 36 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 411120113293 and 411120113302.
It is not a weakly prime, because it can be changed into another prime (411120113311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 205560056660 + 205560056661.
It is an arithmetic number, because the mean of its divisors is an integer number (205560056661).
Almost surely, 2411120113321 is an apocalyptic number.
It is an amenable number.
411120113321 is a deficient number, since it is larger than the sum of its proper divisors (1).
411120113321 is an equidigital number, since it uses as much as digits as its factorization.
411120113321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 411120113321 its reverse (123311021114), we get a palindrome (534431134435).
The spelling of 411120113321 in words is "four hundred eleven billion, one hundred twenty million, one hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •