Base | Representation |
---|---|
bin | 10100110011011010… |
… | …01110011001011101 |
3 | 1001211100212221202011 |
4 | 22121231032121131 |
5 | 140333142012333 |
6 | 5044132031221 |
7 | 543525263341 |
oct | 123155163135 |
9 | 31740787664 |
10 | 11168704093 |
11 | 4811495768 |
12 | 21b8462511 |
13 | 108cb74b61 |
14 | 77d467621 |
15 | 4557b59cd |
hex | 299b4e65d |
11168704093 has 2 divisors, whose sum is σ = 11168704094. Its totient is φ = 11168704092.
The previous prime is 11168704039. The next prime is 11168704103. The reversal of 11168704093 is 39040786111.
Together with previous prime (11168704039) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10694248569 + 474455524 = 103413^2 + 21782^2 .
It is a cyclic number.
It is not a de Polignac number, because 11168704093 - 229 = 10631833181 is a prime.
It is a super-2 number, since 2×111687040932 (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 (11168704493) 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, 5584352046 + 5584352047.
It is an arithmetic number, because the mean of its divisors is an integer number (5584352047).
Almost surely, 211168704093 is an apocalyptic number.
It is an amenable number.
11168704093 is a deficient number, since it is larger than the sum of its proper divisors (1).
11168704093 is an equidigital number, since it uses as much as digits as its factorization.
11168704093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36288, while the sum is 40.
The spelling of 11168704093 in words is "eleven billion, one hundred sixty-eight million, seven hundred four thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •