Base | Representation |
---|---|
bin | 101111111110101000… |
… | …0000110001010100011 |
3 | 100211221112221221101021 |
4 | 1133331100012022203 |
5 | 3142002433244021 |
6 | 115155512550311 |
7 | 10305153632266 |
oct | 1377520061243 |
9 | 324845857337 |
10 | 103033103011 |
11 | 3a772556303 |
12 | 17b756b2397 |
13 | 9940014457 |
14 | 4db5c02cdd |
15 | 2a3066bc41 |
hex | 17fd4062a3 |
103033103011 has 2 divisors, whose sum is σ = 103033103012. Its totient is φ = 103033103010.
The previous prime is 103033102999. The next prime is 103033103023. The reversal of 103033103011 is 110301330301.
It is a balanced prime because it is at equal distance from previous prime (103033102999) and next prime (103033103023).
It is an emirp because it is prime and its reverse (110301330301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103033103011 - 25 = 103033102979 is a prime.
It is a super-2 number, since 2×1030331030112 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103033103911) 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, 51516551505 + 51516551506.
It is an arithmetic number, because the mean of its divisors is an integer number (51516551506).
Almost surely, 2103033103011 is an apocalyptic number.
103033103011 is a deficient number, since it is larger than the sum of its proper divisors (1).
103033103011 is an equidigital number, since it uses as much as digits as its factorization.
103033103011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 103033103011 its reverse (110301330301), we get a palindrome (213334433312).
The spelling of 103033103011 in words is "one hundred three billion, thirty-three million, one hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •