Base | Representation |
---|---|
bin | 111100111011000… |
… | …000110111100011 |
3 | 2122020021012202002 |
4 | 330323000313203 |
5 | 4043124244021 |
6 | 245231114215 |
7 | 34220506106 |
oct | 7473006743 |
9 | 2566235662 |
10 | 1022103011 |
11 | 484a50136 |
12 | 24637296b |
13 | 1339a88a7 |
14 | 99a6273d |
15 | 5eaea50b |
hex | 3cec0de3 |
1022103011 has 2 divisors, whose sum is σ = 1022103012. Its totient is φ = 1022103010.
The previous prime is 1022102987. The next prime is 1022103037. The reversal of 1022103011 is 1103012201.
It is a weak prime.
It is an emirp because it is prime and its reverse (1103012201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1022103011 is a prime.
It is a super-2 number, since 2×10221030112 = 2089389130190532242, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1022102983 and 1022103001.
It is not a weakly prime, because it can be changed into another prime (1022103211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 511051505 + 511051506.
It is an arithmetic number, because the mean of its divisors is an integer number (511051506).
Almost surely, 21022103011 is an apocalyptic number.
1022103011 is a deficient number, since it is larger than the sum of its proper divisors (1).
1022103011 is an equidigital number, since it uses as much as digits as its factorization.
1022103011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 1022103011 is about 31970.3458067003. The cubic root of 1022103011 is about 1007.3140446618.
Adding to 1022103011 its reverse (1103012201), we get a palindrome (2125115212).
The spelling of 1022103011 in words is "one billion, twenty-two million, one hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •