Base | Representation |
---|---|
bin | 101110111001111100111… |
… | …110000000010011001101 |
3 | 102102010221212012102221212 |
4 | 232321330332000103031 |
5 | 410302330424212231 |
6 | 10504435043104205 |
7 | 451606632536345 |
oct | 56717476002315 |
9 | 12363855172855 |
10 | 3223322100941 |
11 | 1033004326568 |
12 | 440850072065 |
13 | 1a4c5b8767b7 |
14 | b201c58dd25 |
15 | 58ca540042b |
hex | 2ee7cf804cd |
3223322100941 has 2 divisors, whose sum is σ = 3223322100942. Its totient is φ = 3223322100940.
The previous prime is 3223322100881. The next prime is 3223322101031. The reversal of 3223322100941 is 1490012233223.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2232122652841 + 991199448100 = 1494029^2 + 995590^2 .
It is a cyclic number.
It is not a de Polignac number, because 3223322100941 - 210 = 3223322099917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3223322100898 and 3223322100907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3223322100641) 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, 1611661050470 + 1611661050471.
It is an arithmetic number, because the mean of its divisors is an integer number (1611661050471).
Almost surely, 23223322100941 is an apocalyptic number.
It is an amenable number.
3223322100941 is a deficient number, since it is larger than the sum of its proper divisors (1).
3223322100941 is an equidigital number, since it uses as much as digits as its factorization.
3223322100941 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
The spelling of 3223322100941 in words is "three trillion, two hundred twenty-three billion, three hundred twenty-two million, one hundred thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •