Base | Representation |
---|---|
bin | 11111010011110000100… |
… | …101100111100011001001 |
3 | 21121200110010112110022102 |
4 | 133103300211213203021 |
5 | 240222303112304121 |
6 | 4324221125203145 |
7 | 311304446414141 |
oct | 37236045474311 |
9 | 7550403473272 |
10 | 2151520041161 |
11 | 75a4aaa783a7 |
12 | 2a8b8b8604b5 |
13 | 127b6ca01b6a |
14 | 761c407d921 |
15 | 3ae7526490b |
hex | 1f4f09678c9 |
2151520041161 has 2 divisors, whose sum is σ = 2151520041162. Its totient is φ = 2151520041160.
The previous prime is 2151520041127. The next prime is 2151520041173. The reversal of 2151520041161 is 1611400251512.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1927601801161 + 223918240000 = 1388381^2 + 473200^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2151520041161 is a prime.
It is a super-2 number, since 2×21515200411612 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (2151520041061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1075760020580 + 1075760020581.
It is an arithmetic number, because the mean of its divisors is an integer number (1075760020581).
Almost surely, 22151520041161 is an apocalyptic number.
It is an amenable number.
2151520041161 is a deficient number, since it is larger than the sum of its proper divisors (1).
2151520041161 is an equidigital number, since it uses as much as digits as its factorization.
2151520041161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2400, while the sum is 29.
Adding to 2151520041161 its reverse (1611400251512), we get a palindrome (3762920292673).
The spelling of 2151520041161 in words is "two trillion, one hundred fifty-one billion, five hundred twenty million, forty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •