Base | Representation |
---|---|
bin | 101110110111111001110… |
… | …001111100010000000011 |
3 | 102101221021110200012021121 |
4 | 232313321301330100003 |
5 | 410233324001421311 |
6 | 10503432420333111 |
7 | 451501245536116 |
oct | 56677161742003 |
9 | 12357243605247 |
10 | 3221121123331 |
11 | 1032084999501 |
12 | 440336b44197 |
13 | 1a499a892197 |
14 | b1c9013a57d |
15 | 58bc708db71 |
hex | 2edf9c7c403 |
3221121123331 has 2 divisors, whose sum is σ = 3221121123332. Its totient is φ = 3221121123330.
The previous prime is 3221121123323. The next prime is 3221121123349. The reversal of 3221121123331 is 1333211211223.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3221121123331 - 23 = 3221121123323 is a prime.
It is a super-2 number, since 2×32211211233312 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3221121123296 and 3221121123305.
It is not a weakly prime, because it can be changed into another prime (3221121123131) 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, 1610560561665 + 1610560561666.
It is an arithmetic number, because the mean of its divisors is an integer number (1610560561666).
Almost surely, 23221121123331 is an apocalyptic number.
3221121123331 is a deficient number, since it is larger than the sum of its proper divisors (1).
3221121123331 is an equidigital number, since it uses as much as digits as its factorization.
3221121123331 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1296, while the sum is 25.
Adding to 3221121123331 its reverse (1333211211223), we get a palindrome (4554332334554).
The spelling of 3221121123331 in words is "three trillion, two hundred twenty-one billion, one hundred twenty-one million, one hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •