Base | Representation |
---|---|
bin | 1100100100111011010… |
… | …00010100100001010001 |
3 | 1112022102200010201101001 |
4 | 12102131220110201101 |
5 | 24040011134303241 |
6 | 530304544142001 |
7 | 43135602430042 |
oct | 6223550244121 |
9 | 1468380121331 |
10 | 432141322321 |
11 | 1572a75685a5 |
12 | 6b903307901 |
13 | 3199b52b967 |
14 | 16cb6b728c9 |
15 | b3934ed431 |
hex | 649da14851 |
432141322321 has 2 divisors, whose sum is σ = 432141322322. Its totient is φ = 432141322320.
The previous prime is 432141322313. The next prime is 432141322331. The reversal of 432141322321 is 123223141234.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 403111977921 + 29029344400 = 634911^2 + 170380^2 .
It is a cyclic number.
It is not a de Polignac number, because 432141322321 - 23 = 432141322313 is a prime.
It is a super-2 number, since 2×4321413223212 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 432141322321.
It is not a weakly prime, because it can be changed into another prime (432141322331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 216070661160 + 216070661161.
It is an arithmetic number, because the mean of its divisors is an integer number (216070661161).
Almost surely, 2432141322321 is an apocalyptic number.
It is an amenable number.
432141322321 is a deficient number, since it is larger than the sum of its proper divisors (1).
432141322321 is an equidigital number, since it uses as much as digits as its factorization.
432141322321 is an evil number, because the sum of its binary digits is even.
The product of its digits is 6912, while the sum is 28.
Adding to 432141322321 its reverse (123223141234), we get a palindrome (555364463555).
The spelling of 432141322321 in words is "four hundred thirty-two billion, one hundred forty-one million, three hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •