Base | Representation |
---|---|
bin | 111111110100110… |
… | …1011001110110101 |
3 | 12112020212010222222 |
4 | 1333221223032311 |
5 | 13341224201123 |
6 | 552302332125 |
7 | 104033365235 |
oct | 17751531665 |
9 | 5466763888 |
10 | 2141631413 |
11 | 9a9993419 |
12 | 4b928a045 |
13 | 28190612c |
14 | 164605cc5 |
15 | c803c6c8 |
hex | 7fa6b3b5 |
2141631413 has 2 divisors, whose sum is σ = 2141631414. Its totient is φ = 2141631412.
The previous prime is 2141631403. The next prime is 2141631431. The reversal of 2141631413 is 3141361412.
It is a happy number.
Together with next prime (2141631431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2134624804 + 7006609 = 46202^2 + 2647^2 .
It is a cyclic number.
It is not a de Polignac number, because 2141631413 - 222 = 2137437109 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2141631403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1070815706 + 1070815707.
It is an arithmetic number, because the mean of its divisors is an integer number (1070815707).
Almost surely, 22141631413 is an apocalyptic number.
It is an amenable number.
2141631413 is a deficient number, since it is larger than the sum of its proper divisors (1).
2141631413 is an equidigital number, since it uses as much as digits as its factorization.
2141631413 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1728, while the sum is 26.
The square root of 2141631413 is about 46277.7636992109. The cubic root of 2141631413 is about 1288.9861258160.
Adding to 2141631413 its reverse (3141361412), we get a palindrome (5282992825).
The spelling of 2141631413 in words is "two billion, one hundred forty-one million, six hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •