Base | Representation |
---|---|
bin | 10000100110101111101… |
… | …001110101100001101111 |
3 | 11001002102011000111002112 |
4 | 100212233221311201233 |
5 | 122144000002012031 |
6 | 2232115322314235 |
7 | 145304565060662 |
oct | 20465751654157 |
9 | 4032364014075 |
10 | 1141113313391 |
11 | 3aaa41797947 |
12 | 1651a465897b |
13 | 837b66c024c |
14 | 3d33187b6d9 |
15 | 1ea3a09d62b |
hex | 109afa7586f |
1141113313391 has 2 divisors, whose sum is σ = 1141113313392. Its totient is φ = 1141113313390.
The previous prime is 1141113313381. The next prime is 1141113313447. The reversal of 1141113313391 is 1933133111411.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1141113313391 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1141113313321) 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, 570556656695 + 570556656696.
It is an arithmetic number, because the mean of its divisors is an integer number (570556656696).
Almost surely, 21141113313391 is an apocalyptic number.
1141113313391 is a deficient number, since it is larger than the sum of its proper divisors (1).
1141113313391 is an equidigital number, since it uses as much as digits as its factorization.
1141113313391 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2916, while the sum is 32.
The spelling of 1141113313391 in words is "one trillion, one hundred forty-one billion, one hundred thirteen million, three hundred thirteen thousand, three hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •