Base | Representation |
---|---|
bin | 110010001000110110000000… |
… | …0110110011000001110011001 |
3 | 2010211112010001220122221221122 |
4 | 1210101230000312120032121 |
5 | 430301133222111011134 |
6 | 4201545504511415025 |
7 | 161615440140245045 |
oct | 14421540066301631 |
9 | 2124463056587848 |
10 | 441020141110169 |
11 | 118582656315855 |
12 | 415687a8b24475 |
13 | 15c11036a943ca |
14 | 7ac96bb0a5025 |
15 | 35ebe2c90302e |
hex | 1911b00d98399 |
441020141110169 has 2 divisors, whose sum is σ = 441020141110170. Its totient is φ = 441020141110168.
The previous prime is 441020141110099. The next prime is 441020141110201. The reversal of 441020141110169 is 961011141020144.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 357499039446025 + 83521101664144 = 18907645^2 + 9138988^2 .
It is a cyclic number.
It is not a de Polignac number, because 441020141110169 - 28 = 441020141109913 is a prime.
It is a super-3 number, since 3×4410201411101693 (a number of 45 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (441020141110369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 220510070555084 + 220510070555085.
It is an arithmetic number, because the mean of its divisors is an integer number (220510070555085).
Almost surely, 2441020141110169 is an apocalyptic number.
It is an amenable number.
441020141110169 is a deficient number, since it is larger than the sum of its proper divisors (1).
441020141110169 is an equidigital number, since it uses as much as digits as its factorization.
441020141110169 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 35.
The spelling of 441020141110169 in words is "four hundred forty-one trillion, twenty billion, one hundred forty-one million, one hundred ten thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •