Base | Representation |
---|---|
bin | 11101111010000110… |
… | …001000111110000111 |
3 | 10001220000122122012222 |
4 | 131322012020332013 |
5 | 1011231434413111 |
6 | 22430321202555 |
7 | 2214536463542 |
oct | 357206107607 |
9 | 101800578188 |
10 | 32113201031 |
11 | 1268a07926a |
12 | 628279045b |
13 | 304a125802 |
14 | 17a8d6d859 |
15 | c7e3ec7db |
hex | 77a188f87 |
32113201031 has 2 divisors, whose sum is σ = 32113201032. Its totient is φ = 32113201030.
The previous prime is 32113201027. The next prime is 32113201033. The reversal of 32113201031 is 13010231123.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 32113201031 - 22 = 32113201027 is a prime.
It is a super-2 number, since 2×321132010312 (a number of 22 digits) contains 22 as substring.
Together with 32113201033, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32113201033) 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, 16056600515 + 16056600516.
It is an arithmetic number, because the mean of its divisors is an integer number (16056600516).
Almost surely, 232113201031 is an apocalyptic number.
32113201031 is a deficient number, since it is larger than the sum of its proper divisors (1).
32113201031 is an equidigital number, since it uses as much as digits as its factorization.
32113201031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 32113201031 its reverse (13010231123), we get a palindrome (45123432154).
The spelling of 32113201031 in words is "thirty-two billion, one hundred thirteen million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •