Base | Representation |
---|---|
bin | 10100100010111001… |
… | …00000001111100011 |
3 | 1001110201002021210202 |
4 | 22101130200033203 |
5 | 140042201244021 |
6 | 5022301215415 |
7 | 540223220504 |
oct | 122134401743 |
9 | 31421067722 |
10 | 11030103011 |
11 | 4750229714 |
12 | 2179b6156b |
13 | 106a237495 |
14 | 768ca8bab |
15 | 448538a0b |
hex | 2917203e3 |
11030103011 has 2 divisors, whose sum is σ = 11030103012. Its totient is φ = 11030103010.
The previous prime is 11030102987. The next prime is 11030103017.
It is a happy number.
11030103011 is nontrivially palindromic in base 10.
It is a strong prime.
It is a palprime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11030103011 is a prime.
It is a super-2 number, since 2×110301030112 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11030102983 and 11030103001.
It is not a weakly prime, because it can be changed into another prime (11030103017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515051505 + 5515051506.
It is an arithmetic number, because the mean of its divisors is an integer number (5515051506).
Almost surely, 211030103011 is an apocalyptic number.
11030103011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11030103011 is an equidigital number, since it uses as much as digits as its factorization.
11030103011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 11.
Multiplying 11030103011 by its sum of digits (11), we get a palindrome (121331133121).
The spelling of 11030103011 in words is "eleven billion, thirty million, one hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •