Base | Representation |
---|---|
bin | 100000111010000010011… |
… | …001001010010100000101 |
3 | 22000011220200222022201022 |
4 | 200322002121022110011 |
5 | 244022211122302441 |
6 | 4450502341240525 |
7 | 322243060343465 |
oct | 40720231122405 |
9 | 8004820868638 |
10 | 2261340431621 |
11 | 7a20357a2177 |
12 | 30631a403145 |
13 | 135321c3381b |
14 | 7b64146bba5 |
15 | 3dc516ce84b |
hex | 20e8264a505 |
2261340431621 has 2 divisors, whose sum is σ = 2261340431622. Its totient is φ = 2261340431620.
The previous prime is 2261340431617. The next prime is 2261340431671. The reversal of 2261340431621 is 1261340431622.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2080558147396 + 180782284225 = 1442414^2 + 425185^2 .
It is a cyclic number.
It is not a de Polignac number, because 2261340431621 - 22 = 2261340431617 is a prime.
It is a super-2 number, since 2×22613404316212 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2261340431611) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1130670215810 + 1130670215811.
It is an arithmetic number, because the mean of its divisors is an integer number (1130670215811).
Almost surely, 22261340431621 is an apocalyptic number.
It is an amenable number.
2261340431621 is a deficient number, since it is larger than the sum of its proper divisors (1).
2261340431621 is an equidigital number, since it uses as much as digits as its factorization.
2261340431621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 35.
Subtracting from 2261340431621 its reverse (1261340431622), we obtain a palindrome (999999999999).
The spelling of 2261340431621 in words is "two trillion, two hundred sixty-one billion, three hundred forty million, four hundred thirty-one thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •