Base | Representation |
---|---|
bin | 10101110011000110… |
… | …11100111101001001 |
3 | 1010012121021200001002 |
4 | 22321203130331021 |
5 | 142431432410233 |
6 | 5213140104345 |
7 | 563003653664 |
oct | 127143347511 |
9 | 33177250032 |
10 | 11703013193 |
11 | 4a66056033 |
12 | 23273950b5 |
13 | 11467803a1 |
14 | 7d03d06db |
15 | 4876596e8 |
hex | 2b98dcf49 |
11703013193 has 2 divisors, whose sum is σ = 11703013194. Its totient is φ = 11703013192.
The previous prime is 11703013139. The next prime is 11703013229. The reversal of 11703013193 is 39131030711.
Together with previous prime (11703013139) 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., 11494412944 + 208600249 = 107212^2 + 14443^2 .
It is an emirp because it is prime and its reverse (39131030711) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11703013193 - 216 = 11702947657 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11703013103) 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, 5851506596 + 5851506597.
It is an arithmetic number, because the mean of its divisors is an integer number (5851506597).
Almost surely, 211703013193 is an apocalyptic number.
It is an amenable number.
11703013193 is a deficient number, since it is larger than the sum of its proper divisors (1).
11703013193 is an equidigital number, since it uses as much as digits as its factorization.
11703013193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1701, while the sum is 29.
The spelling of 11703013193 in words is "eleven billion, seven hundred three million, thirteen thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •