Base | Representation |
---|---|
bin | 111100111101111… |
… | …000101101101001 |
3 | 2122021200110201002 |
4 | 330331320231221 |
5 | 4043322343131 |
6 | 245255204345 |
7 | 34230063404 |
oct | 7475705551 |
9 | 2567613632 |
10 | 1022856041 |
11 | 485414979 |
12 | 2466766b5 |
13 | 133bb057c |
14 | 99bbad3b |
15 | 5ebe86cb |
hex | 3cf78b69 |
1022856041 has 2 divisors, whose sum is σ = 1022856042. Its totient is φ = 1022856040.
The previous prime is 1022856011. The next prime is 1022856047. The reversal of 1022856041 is 1406582201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 991998016 + 30858025 = 31496^2 + 5555^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1022856041 is a prime.
It is a super-2 number, since 2×10228560412 = 2092468961220387362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1022855995 and 1022856013.
It is not a weakly prime, because it can be changed into another prime (1022856047) 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, 511428020 + 511428021.
It is an arithmetic number, because the mean of its divisors is an integer number (511428021).
Almost surely, 21022856041 is an apocalyptic number.
It is an amenable number.
1022856041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022856041 is an equidigital number, since it uses as much as digits as its factorization.
1022856041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3840, while the sum is 29.
The square root of 1022856041 is about 31982.1206457608. The cubic root of 1022856041 is about 1007.5613620326.
The spelling of 1022856041 in words is "one billion, twenty-two million, eight hundred fifty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •