Base | Representation |
---|---|
bin | 1011111101110110… |
… | …0100100011001101 |
3 | 22021212022200012121 |
4 | 2333131210203031 |
5 | 23034310401031 |
6 | 1250424332541 |
7 | 142413151663 |
oct | 27735444315 |
9 | 8255280177 |
10 | 3212200141 |
11 | 13a9226567 |
12 | 757914151 |
13 | 3c2650957 |
14 | 226882c33 |
15 | 13c00d011 |
hex | bf7648cd |
3212200141 has 2 divisors, whose sum is σ = 3212200142. Its totient is φ = 3212200140.
The previous prime is 3212200111. The next prime is 3212200151. The reversal of 3212200141 is 1410022123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2829176100 + 383024041 = 53190^2 + 19571^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3212200141 is a prime.
It is a super-3 number, since 3×32122001413 (a number of 29 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3212200111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1606100070 + 1606100071.
It is an arithmetic number, because the mean of its divisors is an integer number (1606100071).
Almost surely, 23212200141 is an apocalyptic number.
It is an amenable number.
3212200141 is a deficient number, since it is larger than the sum of its proper divisors (1).
3212200141 is an equidigital number, since it uses as much as digits as its factorization.
3212200141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 3212200141 is about 56676.2749393430. The cubic root of 3212200141 is about 1475.4829621749.
Adding to 3212200141 its reverse (1410022123), we get a palindrome (4622222264).
The spelling of 3212200141 in words is "three billion, two hundred twelve million, two hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •