Base | Representation |
---|---|
bin | 100001011010111… |
… | …1110000011110001 |
3 | 2220011012021001222 |
4 | 1002311332003301 |
5 | 4244042202311 |
6 | 303140234425 |
7 | 36535055162 |
oct | 10265760361 |
9 | 2804167058 |
10 | 1121444081 |
11 | 52603159a |
12 | 27369ba15 |
13 | 14b44b4a4 |
14 | a8d21769 |
15 | 686beadb |
hex | 42d7e0f1 |
1121444081 has 2 divisors, whose sum is σ = 1121444082. Its totient is φ = 1121444080.
The previous prime is 1121444041. The next prime is 1121444099. The reversal of 1121444081 is 1804441211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 888576481 + 232867600 = 29809^2 + 15260^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121444081 - 218 = 1121181937 is a prime.
It is a super-2 number, since 2×11214440812 = 2515273653619869122, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1121444081.
It is not a weakly prime, because it can be changed into another prime (1121444021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560722040 + 560722041.
It is an arithmetic number, because the mean of its divisors is an integer number (560722041).
Almost surely, 21121444081 is an apocalyptic number.
It is an amenable number.
1121444081 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121444081 is an equidigital number, since it uses as much as digits as its factorization.
1121444081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1024, while the sum is 26.
The square root of 1121444081 is about 33487.9691979075. The cubic root of 1121444081 is about 1038.9449609465.
Adding to 1121444081 its reverse (1804441211), we get a palindrome (2925885292).
The spelling of 1121444081 in words is "one billion, one hundred twenty-one million, four hundred forty-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •