Base | Representation |
---|---|
bin | 1010000110101011111000… |
… | …1110011110001101111001 |
3 | 1110100002210101120122212001 |
4 | 2201222332032132031321 |
5 | 2424011213041023111 |
6 | 35343504122021001 |
7 | 2224445404302331 |
oct | 241527616361571 |
9 | 43302711518761 |
10 | 11109976892281 |
11 | 35a3795356933 |
12 | 12b5230947761 |
13 | 627887bc0147 |
14 | 2a5a236620c1 |
15 | 143ee173a1c1 |
hex | a1abe39e379 |
11109976892281 has 2 divisors, whose sum is σ = 11109976892282. Its totient is φ = 11109976892280.
The previous prime is 11109976892249. The next prime is 11109976892291. The reversal of 11109976892281 is 18229867990111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9535842816256 + 1574134076025 = 3088016^2 + 1254645^2 .
It is an emirp because it is prime and its reverse (18229867990111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11109976892281 - 25 = 11109976892249 is a prime.
It is a super-2 number, since 2×111099768922812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11109976892291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5554988446140 + 5554988446141.
It is an arithmetic number, because the mean of its divisors is an integer number (5554988446141).
Almost surely, 211109976892281 is an apocalyptic number.
It is an amenable number.
11109976892281 is a deficient number, since it is larger than the sum of its proper divisors (1).
11109976892281 is an equidigital number, since it uses as much as digits as its factorization.
11109976892281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7838208, while the sum is 64.
The spelling of 11109976892281 in words is "eleven trillion, one hundred nine billion, nine hundred seventy-six million, eight hundred ninety-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •