Base | Representation |
---|---|
bin | 1010111101011101… |
… | …0110001001011011 |
3 | 21121001010211111111 |
4 | 2233113112021123 |
5 | 22011141222302 |
6 | 1203540041151 |
7 | 132623500504 |
oct | 25727261133 |
9 | 7531124444 |
10 | 2942132827 |
11 | 127a836a37 |
12 | 6a13931b7 |
13 | 37b7032ca |
14 | 1dca61bab |
15 | 1234630d7 |
hex | af5d625b |
2942132827 has 2 divisors, whose sum is σ = 2942132828. Its totient is φ = 2942132826.
The previous prime is 2942132821. The next prime is 2942132833. The reversal of 2942132827 is 7282312492.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (2942132821) and next prime (2942132833).
It is a cyclic number.
It is not a de Polignac number, because 2942132827 - 219 = 2941608539 is a prime.
It is a super-2 number, since 2×29421328272 = 17312291143422023858, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2942132827.
It is not a weakly prime, because it can be changed into another prime (2942132821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1471066413 + 1471066414.
It is an arithmetic number, because the mean of its divisors is an integer number (1471066414).
Almost surely, 22942132827 is an apocalyptic number.
2942132827 is a deficient number, since it is larger than the sum of its proper divisors (1).
2942132827 is an equidigital number, since it uses as much as digits as its factorization.
2942132827 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 96768, while the sum is 40.
The square root of 2942132827 is about 54241.4309084854. The cubic root of 2942132827 is about 1432.9160874865.
The spelling of 2942132827 in words is "two billion, nine hundred forty-two million, one hundred thirty-two thousand, eight hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •