Base | Representation |
---|---|
bin | 10000010100000111101… |
… | …101010000011000110011 |
3 | 10222011210111002221102222 |
4 | 100110013231100120303 |
5 | 121332021114041441 |
6 | 2215011121431255 |
7 | 143666202540314 |
oct | 20240755203063 |
9 | 3864714087388 |
10 | 1121115768371 |
11 | 3a250a695335 |
12 | 16134349b52b |
13 | 8194a694b81 |
14 | 3c395a3460b |
15 | 1e269669d4b |
hex | 10507b50633 |
1121115768371 has 2 divisors, whose sum is σ = 1121115768372. Its totient is φ = 1121115768370.
The previous prime is 1121115768317. The next prime is 1121115768391. The reversal of 1121115768371 is 1738675111211.
Together with previous prime (1121115768317) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121115768371 is a prime.
It is not a weakly prime, because it can be changed into another prime (1121115768391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560557884185 + 560557884186.
It is an arithmetic number, because the mean of its divisors is an integer number (560557884186).
Almost surely, 21121115768371 is an apocalyptic number.
1121115768371 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121115768371 is an equidigital number, since it uses as much as digits as its factorization.
1121115768371 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 70560, while the sum is 44.
The spelling of 1121115768371 in words is "one trillion, one hundred twenty-one billion, one hundred fifteen million, seven hundred sixty-eight thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •