Base | Representation |
---|---|
bin | 1100110101011100100… |
… | …11111000100100011101 |
3 | 1120011022211012201201002 |
4 | 12122232103320210131 |
5 | 24211142321042341 |
6 | 534333034400045 |
7 | 43601444413601 |
oct | 6325623704435 |
9 | 1504284181632 |
10 | 441011112221 |
11 | 160039303a79 |
12 | 71579890025 |
13 | 3278301b954 |
14 | 174b8b71501 |
15 | b71205929b |
hex | 66ae4f891d |
441011112221 has 2 divisors, whose sum is σ = 441011112222. Its totient is φ = 441011112220.
The previous prime is 441011112187. The next prime is 441011112229. The reversal of 441011112221 is 122211110144.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 440570700025 + 440412196 = 663755^2 + 20986^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-441011112221 is a prime.
It is a super-2 number, since 2×4410111122212 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 441011112193 and 441011112202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (441011112229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 220505556110 + 220505556111.
It is an arithmetic number, because the mean of its divisors is an integer number (220505556111).
Almost surely, 2441011112221 is an apocalyptic number.
It is an amenable number.
441011112221 is a deficient number, since it is larger than the sum of its proper divisors (1).
441011112221 is an equidigital number, since it uses as much as digits as its factorization.
441011112221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 441011112221 its reverse (122211110144), we get a palindrome (563222222365).
The spelling of 441011112221 in words is "four hundred forty-one billion, eleven million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •