Base | Representation |
---|---|
bin | 11111010111111110001… |
… | …011100010010000011001 |
3 | 21122010010100101012211111 |
4 | 133113332023202100121 |
5 | 240311034010131212 |
6 | 4330250021100321 |
7 | 311524520363626 |
oct | 37277613422031 |
9 | 7563110335744 |
10 | 2156043052057 |
11 | 761411105434 |
12 | 2a9a325576a1 |
13 | 128410aa437b |
14 | 764d2a5934d |
15 | 3b13c39aea7 |
hex | 1f5fe2e2419 |
2156043052057 has 2 divisors, whose sum is σ = 2156043052058. Its totient is φ = 2156043052056.
The previous prime is 2156043052027. The next prime is 2156043052061. The reversal of 2156043052057 is 7502503406512.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2109070725696 + 46972326361 = 1452264^2 + 216731^2 .
It is a cyclic number.
It is not a de Polignac number, because 2156043052057 - 215 = 2156043019289 is a prime.
It is a super-2 number, since 2×21560430520572 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2156043052027) 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, 1078021526028 + 1078021526029.
It is an arithmetic number, because the mean of its divisors is an integer number (1078021526029).
Almost surely, 22156043052057 is an apocalyptic number.
It is an amenable number.
2156043052057 is a deficient number, since it is larger than the sum of its proper divisors (1).
2156043052057 is an equidigital number, since it uses as much as digits as its factorization.
2156043052057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252000, while the sum is 40.
Adding to 2156043052057 its reverse (7502503406512), we get a palindrome (9658546458569).
The spelling of 2156043052057 in words is "two trillion, one hundred fifty-six billion, forty-three million, fifty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •