Base | Representation |
---|---|
bin | 111011110110011101111… |
… | …010111000111000111101 |
3 | 112120012012101100202220111 |
4 | 323312131322320320331 |
5 | 1014341241342200212 |
6 | 12425242211350021 |
7 | 603102214023652 |
oct | 73663572707075 |
9 | 15505171322814 |
10 | 4112933162557 |
11 | 134631560116a |
12 | 565144bb2311 |
13 | 23ab03ba798b |
14 | 1030d1ccbc29 |
15 | 71ec0842ea7 |
hex | 3bd9deb8e3d |
4112933162557 has 2 divisors, whose sum is σ = 4112933162558. Its totient is φ = 4112933162556.
The previous prime is 4112933162519. The next prime is 4112933162567. The reversal of 4112933162557 is 7552613392114.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2820286955641 + 1292646206916 = 1679371^2 + 1136946^2 .
It is a cyclic number.
It is not a de Polignac number, because 4112933162557 - 211 = 4112933160509 is a prime.
It is a super-2 number, since 2×41129331625572 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4112933162557.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4112933162567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2056466581278 + 2056466581279.
It is an arithmetic number, because the mean of its divisors is an integer number (2056466581279).
Almost surely, 24112933162557 is an apocalyptic number.
It is an amenable number.
4112933162557 is a deficient number, since it is larger than the sum of its proper divisors (1).
4112933162557 is an equidigital number, since it uses as much as digits as its factorization.
4112933162557 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1360800, while the sum is 49.
The spelling of 4112933162557 in words is "four trillion, one hundred twelve billion, nine hundred thirty-three million, one hundred sixty-two thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •