Base | Representation |
---|---|
bin | 11110000111000110… |
… | …001111010111110101 |
3 | 10002110020002210100222 |
4 | 132013012033113311 |
5 | 1012203310043221 |
6 | 22504112344125 |
7 | 2223125531261 |
oct | 360706172765 |
9 | 102406083328 |
10 | 32331331061 |
11 | 12791214617 |
12 | 6323845045 |
13 | 308338a033 |
14 | 17c9d110a1 |
15 | c936389ab |
hex | 78718f5f5 |
32331331061 has 2 divisors, whose sum is σ = 32331331062. Its totient is φ = 32331331060.
The previous prime is 32331331001. The next prime is 32331331063. The reversal of 32331331061 is 16013313323.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25346550436 + 6984780625 = 159206^2 + 83575^2 .
It is a cyclic number.
It is not a de Polignac number, because 32331331061 - 226 = 32264222197 is a prime.
It is a Sophie Germain prime.
Together with 32331331063, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 32331331061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32331331063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16165665530 + 16165665531.
It is an arithmetic number, because the mean of its divisors is an integer number (16165665531).
Almost surely, 232331331061 is an apocalyptic number.
It is an amenable number.
32331331061 is a deficient number, since it is larger than the sum of its proper divisors (1).
32331331061 is an equidigital number, since it uses as much as digits as its factorization.
32331331061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 32331331061 its reverse (16013313323), we get a palindrome (48344644384).
The spelling of 32331331061 in words is "thirty-two billion, three hundred thirty-one million, three hundred thirty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •