Base | Representation |
---|---|
bin | 1010001011001001… |
… | …1010100011001101 |
3 | 21001100002112002121 |
4 | 2202302122203031 |
5 | 21043131444231 |
6 | 1131001252541 |
7 | 124452115246 |
oct | 24262324315 |
9 | 7040075077 |
10 | 2731124941 |
11 | 1181715656 |
12 | 642794151 |
13 | 346a9377c |
14 | 1bca15ccd |
15 | 10eb82311 |
hex | a2c9a8cd |
2731124941 has 8 divisors (see below), whose sum is σ = 2760941304. Its totient is φ = 2701363200.
The previous prime is 2731124917. The next prime is 2731124947. The reversal of 2731124941 is 1494211372.
It can be written as a sum of positive squares in 4 ways, for example, as 2504502025 + 226622916 = 50045^2 + 15054^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2731124941 - 27 = 2731124813 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2731124897 and 2731124906.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2731124947) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 91245 + ... + 117421.
It is an arithmetic number, because the mean of its divisors is an integer number (345117663).
Almost surely, 22731124941 is an apocalyptic number.
It is an amenable number.
2731124941 is a deficient number, since it is larger than the sum of its proper divisors (29816363).
2731124941 is a wasteful number, since it uses less digits than its factorization.
2731124941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27311.
The product of its digits is 12096, while the sum is 34.
The square root of 2731124941 is about 52260.1659105671. The cubic root of 2731124941 is about 1397.8069305139.
The spelling of 2731124941 in words is "two billion, seven hundred thirty-one million, one hundred twenty-four thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •