Base | Representation |
---|---|
bin | 111111110001111… |
… | …0101101111001101 |
3 | 12112010222102110112 |
4 | 1333203311233031 |
5 | 13340331222311 |
6 | 552205445405 |
7 | 104014364132 |
oct | 17743655715 |
9 | 5463872415 |
10 | 2140101581 |
11 | 9a9038aa2 |
12 | 4b8870865 |
13 | 2814bb9c7 |
14 | 164328589 |
15 | c7d3928b |
hex | 7f8f5bcd |
2140101581 has 2 divisors, whose sum is σ = 2140101582. Its totient is φ = 2140101580.
The previous prime is 2140101527. The next prime is 2140101583. The reversal of 2140101581 is 1851010412.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1335244681 + 804856900 = 36541^2 + 28370^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2140101581 is a prime.
It is a super-2 number, since 2×21401015812 = 9160069553997399122, which contains 22 as substring.
Together with 2140101583, 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 (2140101583) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1070050790 + 1070050791.
It is an arithmetic number, because the mean of its divisors is an integer number (1070050791).
Almost surely, 22140101581 is an apocalyptic number.
It is an amenable number.
2140101581 is a deficient number, since it is larger than the sum of its proper divisors (1).
2140101581 is an equidigital number, since it uses as much as digits as its factorization.
2140101581 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 320, while the sum is 23.
The square root of 2140101581 is about 46261.2319442533. The cubic root of 2140101581 is about 1288.6791321328.
Adding to 2140101581 its reverse (1851010412), we get a palindrome (3991111993).
The spelling of 2140101581 in words is "two billion, one hundred forty million, one hundred one thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •