Base | Representation |
---|---|
bin | 10000010100000000111… |
… | …111000111110100100001 |
3 | 10222011111121221021220102 |
4 | 100110000333013310201 |
5 | 121331303232330421 |
6 | 2214552012552145 |
7 | 143663333243552 |
oct | 20240077076441 |
9 | 3864447837812 |
10 | 1121003011361 |
11 | 3a2461a80322 |
12 | 161311782655 |
13 | 8193020594c |
14 | 3c384a82329 |
15 | 1e25e7e560b |
hex | 10500fc7d21 |
1121003011361 has 2 divisors, whose sum is σ = 1121003011362. Its totient is φ = 1121003011360.
The previous prime is 1121003011313. The next prime is 1121003011397. The reversal of 1121003011361 is 1631103001211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1058262780961 + 62740230400 = 1028719^2 + 250480^2 .
It is an emirp because it is prime and its reverse (1631103001211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1121003011361 - 226 = 1120935902497 is a prime.
It is not a weakly prime, because it can be changed into another prime (1121006011361) 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, 560501505680 + 560501505681.
It is an arithmetic number, because the mean of its divisors is an integer number (560501505681).
Almost surely, 21121003011361 is an apocalyptic number.
It is an amenable number.
1121003011361 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121003011361 is an equidigital number, since it uses as much as digits as its factorization.
1121003011361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 1121003011361 its reverse (1631103001211), we get a palindrome (2752106012572).
The spelling of 1121003011361 in words is "one trillion, one hundred twenty-one billion, three million, eleven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •