Base | Representation |
---|---|
bin | 1010000110010010101110… |
… | …0110101001000001010001 |
3 | 1110022110100122002002021111 |
4 | 2201210223212221001101 |
5 | 2423403344313304222 |
6 | 35340425541253321 |
7 | 2224116122611651 |
oct | 241445346510121 |
9 | 43273318062244 |
10 | 11103222009937 |
11 | 35a0939400842 |
12 | 12b3a66704241 |
13 | 62704c60a545 |
14 | 2a55824b0361 |
15 | 143c486dd777 |
hex | a192b9a9051 |
11103222009937 has 2 divisors, whose sum is σ = 11103222009938. Its totient is φ = 11103222009936.
The previous prime is 11103222009911. The next prime is 11103222009977. The reversal of 11103222009937 is 73990022230111.
It is an a-pointer prime, because the next prime (11103222009977) can be obtained adding 11103222009937 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7918196417041 + 3185025592896 = 2813929^2 + 1784664^2 .
It is a cyclic number.
It is not a de Polignac number, because 11103222009937 - 219 = 11103221485649 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11103222009937.
It is not a weakly prime, because it can be changed into another prime (11103222009907) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551611004968 + 5551611004969.
It is an arithmetic number, because the mean of its divisors is an integer number (5551611004969).
Almost surely, 211103222009937 is an apocalyptic number.
It is an amenable number.
11103222009937 is a deficient number, since it is larger than the sum of its proper divisors (1).
11103222009937 is an equidigital number, since it uses as much as digits as its factorization.
11103222009937 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 40824, while the sum is 40.
The spelling of 11103222009937 in words is "eleven trillion, one hundred three billion, two hundred twenty-two million, nine thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •