Base | Representation |
---|---|
bin | 11110111101001100011… |
… | …101110011001000010101 |
3 | 21112100220121121202211012 |
4 | 132331030131303020111 |
5 | 234323143133112131 |
6 | 4305133031422005 |
7 | 306456162013262 |
oct | 36751435631025 |
9 | 7470817552735 |
10 | 2127291691541 |
11 | 7501a7779765 |
12 | 2a4349824905 |
13 | 1257ab303803 |
14 | 74d663a2269 |
15 | 3a5081b952b |
hex | 1ef4c773215 |
2127291691541 has 2 divisors, whose sum is σ = 2127291691542. Its totient is φ = 2127291691540.
The previous prime is 2127291691537. The next prime is 2127291691559. The reversal of 2127291691541 is 1451961927212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2125556969041 + 1734722500 = 1457929^2 + 41650^2 .
It is a cyclic number.
It is not a de Polignac number, because 2127291691541 - 22 = 2127291691537 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2127291691541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2127291691741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1063645845770 + 1063645845771.
It is an arithmetic number, because the mean of its divisors is an integer number (1063645845771).
Almost surely, 22127291691541 is an apocalyptic number.
It is an amenable number.
2127291691541 is a deficient number, since it is larger than the sum of its proper divisors (1).
2127291691541 is an equidigital number, since it uses as much as digits as its factorization.
2127291691541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 544320, while the sum is 50.
The spelling of 2127291691541 in words is "two trillion, one hundred twenty-seven billion, two hundred ninety-one million, six hundred ninety-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •