Base | Representation |
---|---|
bin | 1010000110001011101011… |
… | …0101100111111100111101 |
3 | 1110022021110210010201122021 |
4 | 2201202322311213330331 |
5 | 2423341011002043232 |
6 | 35335514115320141 |
7 | 2224021211006314 |
oct | 241427265477475 |
9 | 43267423121567 |
10 | 11101330112317 |
11 | 35a005848a095 |
12 | 12b3618bb0051 |
13 | 626b0a6828b3 |
14 | 2a544311527b |
15 | 143b87581397 |
hex | a18bad67f3d |
11101330112317 has 2 divisors, whose sum is σ = 11101330112318. Its totient is φ = 11101330112316.
The previous prime is 11101330112281. The next prime is 11101330112339. The reversal of 11101330112317 is 71321103310111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9677362835716 + 1423967276601 = 3110846^2 + 1193301^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101330112317 - 27 = 11101330112189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11101330112291 and 11101330112300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11101330812317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550665056158 + 5550665056159.
It is an arithmetic number, because the mean of its divisors is an integer number (5550665056159).
Almost surely, 211101330112317 is an apocalyptic number.
It is an amenable number.
11101330112317 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101330112317 is an equidigital number, since it uses as much as digits as its factorization.
11101330112317 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 378, while the sum is 25.
Adding to 11101330112317 its reverse (71321103310111), we get a palindrome (82422433422428).
The spelling of 11101330112317 in words is "eleven trillion, one hundred one billion, three hundred thirty million, one hundred twelve thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •