Base | Representation |
---|---|
bin | 11101111011010001… |
… | …010111100100001001 |
3 | 10001221101202112202202 |
4 | 131323101113210021 |
5 | 1011302011442414 |
6 | 22432304005545 |
7 | 2215166220125 |
oct | 357321274411 |
9 | 101841675682 |
10 | 32132921609 |
11 | 1269a218668 |
12 | 62893008b5 |
13 | 305123b9a9 |
14 | 17ab824585 |
15 | c80ee59de |
hex | 77b457909 |
32132921609 has 2 divisors, whose sum is σ = 32132921610. Its totient is φ = 32132921608.
The previous prime is 32132921503. The next prime is 32132921647. The reversal of 32132921609 is 90612923123.
It is a happy number.
It is an a-pointer prime, because the next prime (32132921647) can be obtained adding 32132921609 to its sum of digits (38).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29804569600 + 2328352009 = 172640^2 + 48253^2 .
It is a cyclic number.
It is not a de Polignac number, because 32132921609 - 228 = 31864486153 is a prime.
It is a super-2 number, since 2×321329216092 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (32132921659) 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, 16066460804 + 16066460805.
It is an arithmetic number, because the mean of its divisors is an integer number (16066460805).
Almost surely, 232132921609 is an apocalyptic number.
It is an amenable number.
32132921609 is a deficient number, since it is larger than the sum of its proper divisors (1).
32132921609 is an equidigital number, since it uses as much as digits as its factorization.
32132921609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 38.
The spelling of 32132921609 in words is "thirty-two billion, one hundred thirty-two million, nine hundred twenty-one thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •