Base | Representation |
---|---|
bin | 111110111110111… |
… | …110101000001001 |
3 | 2201122100202120001 |
4 | 332332332220021 |
5 | 4131003244331 |
6 | 252504403001 |
7 | 35120526544 |
oct | 7676765011 |
9 | 2648322501 |
10 | 1056696841 |
11 | 4a2528a82 |
12 | 255a76461 |
13 | 13abcb805 |
14 | a04a985b |
15 | 62b80561 |
hex | 3efbea09 |
1056696841 has 2 divisors, whose sum is σ = 1056696842. Its totient is φ = 1056696840.
The previous prime is 1056696793. The next prime is 1056696859. The reversal of 1056696841 is 1486966501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 998876025 + 57820816 = 31605^2 + 7604^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056696841 - 27 = 1056696713 is a prime.
It is a super-2 number, since 2×10566968412 = 2233216427558758562, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1056696791 and 1056696800.
It is not a weakly prime, because it can be changed into another prime (1056696941) 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, 528348420 + 528348421.
It is an arithmetic number, because the mean of its divisors is an integer number (528348421).
Almost surely, 21056696841 is an apocalyptic number.
It is an amenable number.
1056696841 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056696841 is an equidigital number, since it uses as much as digits as its factorization.
1056696841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 311040, while the sum is 46.
The square root of 1056696841 is about 32506.8737500240. The cubic root of 1056696841 is about 1018.5526187363.
The spelling of 1056696841 in words is "one billion, fifty-six million, six hundred ninety-six thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •