Base | Representation |
---|---|
bin | 10000010100001110110… |
… | …001011111111101101101 |
3 | 10222012002202012001102202 |
4 | 100110032301133331231 |
5 | 121332241441240021 |
6 | 2215030554431245 |
7 | 144002142323465 |
oct | 20241661377555 |
9 | 3865082161382 |
10 | 1121234321261 |
11 | 3a25705a892a |
12 | 161377132525 |
13 | 81969103202 |
14 | 3c3a7694ba5 |
15 | 1e274c86a0b |
hex | 1050ec5ff6d |
1121234321261 has 2 divisors, whose sum is σ = 1121234321262. Its totient is φ = 1121234321260.
The previous prime is 1121234321257. The next prime is 1121234321323. The reversal of 1121234321261 is 1621234321211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1119933276361 + 1301044900 = 1058269^2 + 36070^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121234321261 - 22 = 1121234321257 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121234321461) 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, 560617160630 + 560617160631.
It is an arithmetic number, because the mean of its divisors is an integer number (560617160631).
Almost surely, 21121234321261 is an apocalyptic number.
It is an amenable number.
1121234321261 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121234321261 is an equidigital number, since it uses as much as digits as its factorization.
1121234321261 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3456, while the sum is 29.
Adding to 1121234321261 its reverse (1621234321211), we get a palindrome (2742468642472).
The spelling of 1121234321261 in words is "one trillion, one hundred twenty-one billion, two hundred thirty-four million, three hundred twenty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •