Base | Representation |
---|---|
bin | 10100101100110001… |
… | …10001011111111001 |
3 | 1001200111002110110011 |
4 | 22112120301133321 |
5 | 140224412324233 |
6 | 5034422221521 |
7 | 542251015354 |
oct | 122630613771 |
9 | 31614073404 |
10 | 11113011193 |
11 | 4793006879 |
12 | 21a18848a1 |
13 | 108147548b |
14 | 775ccb29b |
15 | 4509640cd |
hex | 2966317f9 |
11113011193 has 2 divisors, whose sum is σ = 11113011194. Its totient is φ = 11113011192.
The previous prime is 11113011181. The next prime is 11113011313. The reversal of 11113011193 is 39111031111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6430756864 + 4682254329 = 80192^2 + 68427^2 .
It is a cyclic number.
It is not a de Polignac number, because 11113011193 - 213 = 11113003001 is a prime.
It is not a weakly prime, because it can be changed into another prime (11113011893) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5556505596 + 5556505597.
It is an arithmetic number, because the mean of its divisors is an integer number (5556505597).
Almost surely, 211113011193 is an apocalyptic number.
It is an amenable number.
11113011193 is a deficient number, since it is larger than the sum of its proper divisors (1).
11113011193 is an equidigital number, since it uses as much as digits as its factorization.
11113011193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 22.
The spelling of 11113011193 in words is "eleven billion, one hundred thirteen million, eleven thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •