Base | Representation |
---|---|
bin | 11110001100100101… |
… | …100101010011110101 |
3 | 10002200122102002002222 |
4 | 132030211211103311 |
5 | 1012400344332321 |
6 | 22521202412125 |
7 | 2225324431346 |
oct | 361445452365 |
9 | 102618362088 |
10 | 32423433461 |
11 | 12829201501 |
12 | 634a661045 |
13 | 3099496bb3 |
14 | 17d82480cd |
15 | c9b77d3ab |
hex | 78c9654f5 |
32423433461 has 2 divisors, whose sum is σ = 32423433462. Its totient is φ = 32423433460.
The previous prime is 32423433439. The next prime is 32423433521. The reversal of 32423433461 is 16433432423.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18355101361 + 14068332100 = 135481^2 + 118610^2 .
It is an emirp because it is prime and its reverse (16433432423) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 32423433461 - 26 = 32423433397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32423438461) 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, 16211716730 + 16211716731.
It is an arithmetic number, because the mean of its divisors is an integer number (16211716731).
Almost surely, 232423433461 is an apocalyptic number.
It is an amenable number.
32423433461 is a deficient number, since it is larger than the sum of its proper divisors (1).
32423433461 is an equidigital number, since it uses as much as digits as its factorization.
32423433461 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 124416, while the sum is 35.
Adding to 32423433461 its reverse (16433432423), we get a palindrome (48856865884).
The spelling of 32423433461 in words is "thirty-two billion, four hundred twenty-three million, four hundred thirty-three thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •