Base | Representation |
---|---|
bin | 1000010000000110… |
… | …1110000001000101 |
3 | 12201100222211221212 |
4 | 2010001232001011 |
5 | 14014022340031 |
6 | 1003444021205 |
7 | 105614361503 |
oct | 20401560105 |
9 | 5640884855 |
10 | 2215043141 |
11 | a37374773 |
12 | 519991805 |
13 | 293b9a81c |
14 | 170275673 |
15 | ce6de12b |
hex | 8406e045 |
2215043141 has 2 divisors, whose sum is σ = 2215043142. Its totient is φ = 2215043140.
The previous prime is 2215043107. The next prime is 2215043143. The reversal of 2215043141 is 1413405122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2178088900 + 36954241 = 46670^2 + 6079^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2215043141 is a prime.
It is a super-2 number, since 2×22150431412 = 9812832232982291762, which contains 22 as substring.
Together with 2215043143, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2215043143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1107521570 + 1107521571.
It is an arithmetic number, because the mean of its divisors is an integer number (1107521571).
Almost surely, 22215043141 is an apocalyptic number.
It is an amenable number.
2215043141 is a deficient number, since it is larger than the sum of its proper divisors (1).
2215043141 is an equidigital number, since it uses as much as digits as its factorization.
2215043141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 960, while the sum is 23.
The square root of 2215043141 is about 47064.2448255573. The cubic root of 2215043141 is about 1303.5491067605.
Adding to 2215043141 its reverse (1413405122), we get a palindrome (3628448263).
The spelling of 2215043141 in words is "two billion, two hundred fifteen million, forty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •