Base | Representation |
---|---|
bin | 100101110100001001100101… |
… | …0101101100111001110111001 |
3 | 1121121201102201012022101220202 |
4 | 1023220103022231213032321 |
5 | 322044143043121214413 |
6 | 3135232454343331545 |
7 | 130030131154224005 |
oct | 11350231255471671 |
9 | 1547642635271822 |
10 | 332622848226233 |
11 | 96a90615400454 |
12 | 31380652a50bb5 |
13 | 1137a27a524706 |
14 | 5c1d0631b7705 |
15 | 286c43c2b2e58 |
hex | 12e84cab673b9 |
332622848226233 has 2 divisors, whose sum is σ = 332622848226234. Its totient is φ = 332622848226232.
The previous prime is 332622848226113. The next prime is 332622848226239.
332622848226233 is nontrivially palindromic in base 10.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 290118081319609 + 42504766906624 = 17032853^2 + 6519568^2 .
It is a palprime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-332622848226233 is a prime.
It is a super-2 number, since 2×3326228482262332 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (332622848226239) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 166311424113116 + 166311424113117.
It is an arithmetic number, because the mean of its divisors is an integer number (166311424113117).
Almost surely, 2332622848226233 is an apocalyptic number.
It is an amenable number.
332622848226233 is a deficient number, since it is larger than the sum of its proper divisors (1).
332622848226233 is an equidigital number, since it uses as much as digits as its factorization.
332622848226233 is an evil number, because the sum of its binary digits is even.
The product of its digits is 47775744, while the sum is 56.
The spelling of 332622848226233 in words is "three hundred thirty-two trillion, six hundred twenty-two billion, eight hundred forty-eight million, two hundred twenty-six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •