Base | Representation |
---|---|
bin | 10000010100001000101… |
… | …000100000110001100011 |
3 | 10222011211120100010120002 |
4 | 100110020220200301203 |
5 | 121332034103130422 |
6 | 2215012434410215 |
7 | 143666451554654 |
oct | 20241050406143 |
9 | 3864746303502 |
10 | 1121131301987 |
11 | 3a2518434a34 |
12 | 16134873096b |
13 | 81950973368 |
14 | 3c397b1952b |
15 | 1e26abd7692 |
hex | 10508a20c63 |
1121131301987 has 2 divisors, whose sum is σ = 1121131301988. Its totient is φ = 1121131301986.
The previous prime is 1121131301957. The next prime is 1121131302013. The reversal of 1121131301987 is 7891031311211.
It is a strong prime.
It is an emirp because it is prime and its reverse (7891031311211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1121131301987 - 216 = 1121131236451 is a prime.
It is a super-6 number, since 6×11211313019876 (a number of 74 digits) contains 666666 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1121131301987.
It is not a weakly prime, because it can be changed into another prime (1121131301957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560565650993 + 560565650994.
It is an arithmetic number, because the mean of its divisors is an integer number (560565650994).
Almost surely, 21121131301987 is an apocalyptic number.
1121131301987 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121131301987 is an equidigital number, since it uses as much as digits as its factorization.
1121131301987 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 38.
The spelling of 1121131301987 in words is "one trillion, one hundred twenty-one billion, one hundred thirty-one million, three hundred one thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •