Base | Representation |
---|---|
bin | 10100100010111000… |
… | …01000110010000101 |
3 | 1001110200220101222201 |
4 | 22101130020302011 |
5 | 140042140210132 |
6 | 5022255154501 |
7 | 540222340366 |
oct | 122134106205 |
9 | 31420811881 |
10 | 11030006917 |
11 | 47501734a6 |
12 | 2179b15a31 |
13 | 106a202817 |
14 | 768c81b6d |
15 | 44851a2e7 |
hex | 291708c85 |
11030006917 has 2 divisors, whose sum is σ = 11030006918. Its totient is φ = 11030006916.
The previous prime is 11030006893. The next prime is 11030006921. The reversal of 11030006917 is 71960003011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9990202401 + 1039804516 = 99951^2 + 32246^2 .
It is a cyclic number.
It is not a de Polignac number, because 11030006917 - 227 = 10895789189 is a prime.
It is a super-2 number, since 2×110300069172 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11030006947) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515003458 + 5515003459.
It is an arithmetic number, because the mean of its divisors is an integer number (5515003459).
Almost surely, 211030006917 is an apocalyptic number.
It is an amenable number.
11030006917 is a deficient number, since it is larger than the sum of its proper divisors (1).
11030006917 is an equidigital number, since it uses as much as digits as its factorization.
11030006917 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 28.
Adding to 11030006917 its reverse (71960003011), we get a palindrome (82990009928).
The spelling of 11030006917 in words is "eleven billion, thirty million, six thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •