Base | Representation |
---|---|
bin | 1100100101011100101… |
… | …00110001011000100111 |
3 | 1112100011012011122220111 |
4 | 12102232110301120213 |
5 | 24041044340112333 |
6 | 530352431313451 |
7 | 43145543225146 |
oct | 6225624613047 |
9 | 1470135148814 |
10 | 432421410343 |
11 | 1574306818aa |
12 | 6b98107b887 |
13 | 31a14577410 |
14 | 16d0204175d |
15 | b3acdc74cd |
hex | 64ae531627 |
432421410343 has 64 divisors (see below), whose sum is σ = 511173734400. Its totient is φ = 362234695680.
The previous prime is 432421410331. The next prime is 432421410359. The reversal of 432421410343 is 343014124234.
It is not a de Polignac number, because 432421410343 - 221 = 432419313191 is a prime.
It is a super-2 number, since 2×4324214103432 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (432421410643) 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 in 63 ways as a sum of consecutive naturals, for example, 424358088 + ... + 424359106.
It is an arithmetic number, because the mean of its divisors is an integer number (7987089600).
Almost surely, 2432421410343 is an apocalyptic number.
432421410343 is a deficient number, since it is larger than the sum of its proper divisors (78752324057).
432421410343 is a wasteful number, since it uses less digits than its factorization.
432421410343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1592.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 432421410343 its reverse (343014124234), we get a palindrome (775435534577).
The spelling of 432421410343 in words is "four hundred thirty-two billion, four hundred twenty-one million, four hundred ten thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •