Base | Representation |
---|---|
bin | 100010000010100… |
… | …1100000111100001 |
3 | 2221121021022222122 |
4 | 1010011030013201 |
5 | 4314401223131 |
6 | 305201314025 |
7 | 40206430226 |
oct | 10405140741 |
9 | 2847238878 |
10 | 1142211041 |
11 | 536826074 |
12 | 27a635915 |
13 | 15283ca2a |
14 | ab9a994d |
15 | 6a422d7b |
hex | 4414c1e1 |
1142211041 has 2 divisors, whose sum is σ = 1142211042. Its totient is φ = 1142211040.
The previous prime is 1142211019. The next prime is 1142211043. The reversal of 1142211041 is 1401122411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 723394816 + 418816225 = 26896^2 + 20465^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1142211041 is a prime.
It is a Sophie Germain prime.
Together with 1142211043, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1142211043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 571105520 + 571105521.
It is an arithmetic number, because the mean of its divisors is an integer number (571105521).
Almost surely, 21142211041 is an apocalyptic number.
It is an amenable number.
1142211041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1142211041 is an equidigital number, since it uses as much as digits as its factorization.
1142211041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
The square root of 1142211041 is about 33796.6128628299. The cubic root of 1142211041 is about 1045.3188563248.
Adding to 1142211041 its reverse (1401122411), we get a palindrome (2543333452).
The spelling of 1142211041 in words is "one billion, one hundred forty-two million, two hundred eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •