Base | Representation |
---|---|
bin | 111111100011101… |
… | …1001101010001101 |
3 | 12111121221200001221 |
4 | 1333013121222031 |
5 | 13331424142131 |
6 | 551342003341 |
7 | 103564124254 |
oct | 17707315215 |
9 | 5447850057 |
10 | 2132646541 |
11 | 9a4906a03 |
12 | 4b6276551 |
13 | 27caab63c |
14 | 16334779b |
15 | c7365411 |
hex | 7f1d9a8d |
2132646541 has 2 divisors, whose sum is σ = 2132646542. Its totient is φ = 2132646540.
The previous prime is 2132646521. The next prime is 2132646553. The reversal of 2132646541 is 1456462312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1931602500 + 201044041 = 43950^2 + 14179^2 .
It is a cyclic number.
It is not a de Polignac number, because 2132646541 - 213 = 2132638349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2132646497 and 2132646506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2132646511) 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, 1066323270 + 1066323271.
It is an arithmetic number, because the mean of its divisors is an integer number (1066323271).
Almost surely, 22132646541 is an apocalyptic number.
It is an amenable number.
2132646541 is a deficient number, since it is larger than the sum of its proper divisors (1).
2132646541 is an equidigital number, since it uses as much as digits as its factorization.
2132646541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 34560, while the sum is 34.
The square root of 2132646541 is about 46180.5861916022. The cubic root of 2132646541 is about 1287.1810207498.
The spelling of 2132646541 in words is "two billion, one hundred thirty-two million, six hundred forty-six thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •