Base | Representation |
---|---|
bin | 1100110110011010101… |
… | …11110101000101110001 |
3 | 1120012200010210202221212 |
4 | 12123031113311011301 |
5 | 24213224223141431 |
6 | 534500452125505 |
7 | 43620403055351 |
oct | 6331527650561 |
9 | 1505603722855 |
10 | 441532240241 |
11 | 160286491194 |
12 | 716a4306895 |
13 | 32836c90721 |
14 | 17528066b61 |
15 | b742b9772b |
hex | 66cd5f5171 |
441532240241 has 2 divisors, whose sum is σ = 441532240242. Its totient is φ = 441532240240.
The previous prime is 441532240199. The next prime is 441532240277. The reversal of 441532240241 is 142042235144.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 375523840000 + 66008400241 = 612800^2 + 256921^2 .
It is a cyclic number.
It is not a de Polignac number, because 441532240241 - 226 = 441465131377 is a prime.
It is a super-2 number, since 2×4415322402412 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 441532240198 and 441532240207.
It is not a weakly prime, because it can be changed into another prime (441532242241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 220766120120 + 220766120121.
It is an arithmetic number, because the mean of its divisors is an integer number (220766120121).
Almost surely, 2441532240241 is an apocalyptic number.
It is an amenable number.
441532240241 is a deficient number, since it is larger than the sum of its proper divisors (1).
441532240241 is an equidigital number, since it uses as much as digits as its factorization.
441532240241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 30720, while the sum is 32.
Adding to 441532240241 its reverse (142042235144), we get a palindrome (583574475385).
The spelling of 441532240241 in words is "four hundred forty-one billion, five hundred thirty-two million, two hundred forty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •