Base | Representation |
---|---|
bin | 10000001110101111011… |
… | …100110111111010000101 |
3 | 10221121212222012011200021 |
4 | 100032233130313322011 |
5 | 121233204032031433 |
6 | 2212214041215141 |
7 | 143403111344446 |
oct | 20165734677205 |
9 | 3847788164607 |
10 | 1115340111493 |
11 | 3a0016463893 |
12 | 1601b11914b1 |
13 | 81239c2761a |
14 | 3bda89432cd |
15 | 1e02c59922d |
hex | 103af737e85 |
1115340111493 has 2 divisors, whose sum is σ = 1115340111494. Its totient is φ = 1115340111492.
The previous prime is 1115340111439. The next prime is 1115340111499. The reversal of 1115340111493 is 3941110435111.
Together with previous prime (1115340111439) 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., 1020702048804 + 94638062689 = 1010298^2 + 307633^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1115340111493 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1115340111499) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 557670055746 + 557670055747.
It is an arithmetic number, because the mean of its divisors is an integer number (557670055747).
Almost surely, 21115340111493 is an apocalyptic number.
It is an amenable number.
1115340111493 is a deficient number, since it is larger than the sum of its proper divisors (1).
1115340111493 is an equidigital number, since it uses as much as digits as its factorization.
1115340111493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 34.
The spelling of 1115340111493 in words is "one trillion, one hundred fifteen billion, three hundred forty million, one hundred eleven thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •