Base | Representation |
---|---|
bin | 11110000000011110… |
… | …011000101001111111 |
3 | 10002011111000202200122 |
4 | 132000132120221333 |
5 | 1011441334020111 |
6 | 22445103045155 |
7 | 2220306231356 |
oct | 360036305177 |
9 | 102144022618 |
10 | 32220220031 |
11 | 1273452421a |
12 | 62b25a07bb |
13 | 306635606c |
14 | 17b926a99d |
15 | c889dbcdb |
hex | 780798a7f |
32220220031 has 2 divisors, whose sum is σ = 32220220032. Its totient is φ = 32220220030.
The previous prime is 32220220027. The next prime is 32220220033. The reversal of 32220220031 is 13002202223.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 32220220031 - 22 = 32220220027 is a prime.
It is a super-2 number, since 2×322202200312 (a number of 22 digits) contains 22 as substring.
Together with 32220220033, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 32220219991 and 32220220009.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32220220033) 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, 16110110015 + 16110110016.
It is an arithmetic number, because the mean of its divisors is an integer number (16110110016).
Almost surely, 232220220031 is an apocalyptic number.
32220220031 is a deficient number, since it is larger than the sum of its proper divisors (1).
32220220031 is an equidigital number, since it uses as much as digits as its factorization.
32220220031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 32220220031 its reverse (13002202223), we get a palindrome (45222422254).
The spelling of 32220220031 in words is "thirty-two billion, two hundred twenty million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •