Base | Representation |
---|---|
bin | 111110101000001… |
… | …1000001101000001 |
3 | 12102110020111012122 |
4 | 1331100120031001 |
5 | 13300432223231 |
6 | 544305134025 |
7 | 103034664044 |
oct | 17520301501 |
9 | 5373214178 |
10 | 2101445441 |
11 | 989236077 |
12 | 4a792a315 |
13 | 2764a5a54 |
14 | 15d144c5b |
15 | c475077b |
hex | 7d418341 |
2101445441 has 2 divisors, whose sum is σ = 2101445442. Its totient is φ = 2101445440.
The previous prime is 2101445413. The next prime is 2101445459. The reversal of 2101445441 is 1445441012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2032206400 + 69239041 = 45080^2 + 8321^2 .
It is a cyclic number.
It is not a de Polignac number, because 2101445441 - 210 = 2101444417 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2101445441.
It is not a weakly prime, because it can be changed into another prime (2101445461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1050722720 + 1050722721.
It is an arithmetic number, because the mean of its divisors is an integer number (1050722721).
Almost surely, 22101445441 is an apocalyptic number.
It is an amenable number.
2101445441 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101445441 is an equidigital number, since it uses as much as digits as its factorization.
2101445441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2560, while the sum is 26.
The square root of 2101445441 is about 45841.5252909412. The cubic root of 2101445441 is about 1280.8729073853.
Adding to 2101445441 its reverse (1445441012), we get a palindrome (3546886453).
The spelling of 2101445441 in words is "two billion, one hundred one million, four hundred forty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •