Base | Representation |
---|---|
bin | 10000010100000000111… |
… | …000101000011011011001 |
3 | 10222011111111201211221211 |
4 | 100110000320220123121 |
5 | 121331302313404123 |
6 | 2214551512303121 |
7 | 143663312626222 |
oct | 20240070503331 |
9 | 3864444654854 |
10 | 1121001309913 |
11 | 3a2461018a71 |
12 | 1613110a1aa1 |
13 | 8192ca5b384 |
14 | 3c38475c249 |
15 | 1e25e5ab40d |
hex | 10500e286d9 |
1121001309913 has 2 divisors, whose sum is σ = 1121001309914. Its totient is φ = 1121001309912.
The previous prime is 1121001309851. The next prime is 1121001309919. The reversal of 1121001309913 is 3199031001211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1115332424649 + 5668885264 = 1056093^2 + 75292^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121001309913 is a prime.
It is not a weakly prime, because it can be changed into another prime (1121001309919) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560500654956 + 560500654957.
It is an arithmetic number, because the mean of its divisors is an integer number (560500654957).
Almost surely, 21121001309913 is an apocalyptic number.
It is an amenable number.
1121001309913 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121001309913 is an equidigital number, since it uses as much as digits as its factorization.
1121001309913 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 31.
The spelling of 1121001309913 in words is "one trillion, one hundred twenty-one billion, one million, three hundred nine thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •