Base | Representation |
---|---|
bin | 100001011010111… |
… | …1000011101111101 |
3 | 2220011011002122211 |
4 | 1002311320131331 |
5 | 4244040434211 |
6 | 303135540421 |
7 | 36534631336 |
oct | 10265703575 |
9 | 2804132584 |
10 | 1121421181 |
11 | 526016371 |
12 | 27368a711 |
13 | 14b440c3a |
14 | a8d1728d |
15 | 686b7e21 |
hex | 42d7877d |
1121421181 has 2 divisors, whose sum is σ = 1121421182. Its totient is φ = 1121421180.
The previous prime is 1121421179. The next prime is 1121421251. The reversal of 1121421181 is 1811241211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 854392900 + 267028281 = 29230^2 + 16341^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121421181 - 21 = 1121421179 is a prime.
It is a super-2 number, since 2×11214211812 = 2515170930390869522, which contains 22 as substring.
Together with 1121421179, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121421101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560710590 + 560710591.
It is an arithmetic number, because the mean of its divisors is an integer number (560710591).
Almost surely, 21121421181 is an apocalyptic number.
It is an amenable number.
1121421181 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121421181 is an equidigital number, since it uses as much as digits as its factorization.
1121421181 is an evil number, because the sum of its binary digits is even.
The product of its digits is 128, while the sum is 22.
The square root of 1121421181 is about 33487.6272823262. The cubic root of 1121421181 is about 1038.9378891118.
Adding to 1121421181 its reverse (1811241211), we get a palindrome (2932662392).
The spelling of 1121421181 in words is "one billion, one hundred twenty-one million, four hundred twenty-one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •