Base | Representation |
---|---|
bin | 11101111010100011… |
… | …111100100100000101 |
3 | 10001220120100121022221 |
4 | 131322203330210011 |
5 | 1011240434431113 |
6 | 22431200452341 |
7 | 2214663055456 |
oct | 357243744405 |
9 | 101816317287 |
10 | 32121014533 |
11 | 12693525703 |
12 | 628531a0b1 |
13 | 304b93009a |
14 | 17aa00512d |
15 | c7ee4298d |
hex | 77a8fc905 |
32121014533 has 2 divisors, whose sum is σ = 32121014534. Its totient is φ = 32121014532.
The previous prime is 32121014507. The next prime is 32121014537. The reversal of 32121014533 is 33541012123.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20875048324 + 11245966209 = 144482^2 + 106047^2 .
It is a cyclic number.
It is not a de Polignac number, because 32121014533 - 25 = 32121014501 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32121014498 and 32121014507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32121014537) 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, 16060507266 + 16060507267.
It is an arithmetic number, because the mean of its divisors is an integer number (16060507267).
Almost surely, 232121014533 is an apocalyptic number.
It is an amenable number.
32121014533 is a deficient number, since it is larger than the sum of its proper divisors (1).
32121014533 is an equidigital number, since it uses as much as digits as its factorization.
32121014533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 32121014533 its reverse (33541012123), we get a palindrome (65662026656).
The spelling of 32121014533 in words is "thirty-two billion, one hundred twenty-one million, fourteen thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •