Base | Representation |
---|---|
bin | 1100100101110001010… |
… | …10101111001100001001 |
3 | 1112100121021200220210001 |
4 | 12102320222233030021 |
5 | 24041423301100211 |
6 | 530421550523001 |
7 | 43153051216411 |
oct | 6227052571411 |
9 | 1470537626701 |
10 | 432594940681 |
11 | 15750a625802 |
12 | 6ba0b206461 |
13 | 31a414c45a7 |
14 | 16d1b0d3641 |
15 | b3bd253ac1 |
hex | 64b8aaf309 |
432594940681 has 2 divisors, whose sum is σ = 432594940682. Its totient is φ = 432594940680.
The previous prime is 432594940619. The next prime is 432594940691. The reversal of 432594940681 is 186049495234.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 268962555456 + 163632385225 = 518616^2 + 404515^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-432594940681 is a prime.
It is a super-2 number, since 2×4325949406812 (a number of 24 digits) contains 22 as substring.
It is the 657720-th Hogben number.
It is not a weakly prime, because it can be changed into another prime (432594940691) by changing a digit.
It is a nontrivial repunit in base 657719.
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, 216297470340 + 216297470341.
It is an arithmetic number, because the mean of its divisors is an integer number (216297470341).
Almost surely, 2432594940681 is an apocalyptic number.
It is an amenable number.
432594940681 is a deficient number, since it is larger than the sum of its proper divisors (1).
432594940681 is an equidigital number, since it uses as much as digits as its factorization.
432594940681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7464960, while the sum is 55.
The spelling of 432594940681 in words is "four hundred thirty-two billion, five hundred ninety-four million, nine hundred forty thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •