Base | Representation |
---|---|
bin | 1100010110000000011… |
… | …11001110000110111111 |
3 | 1111112202111012111221221 |
4 | 12023000033032012333 |
5 | 23422110243313211 |
6 | 522502112534211 |
7 | 42433246414363 |
oct | 6130017160677 |
9 | 1445674174857 |
10 | 424132010431 |
11 | 15396750aa78 |
12 | 6a248b51367 |
13 | 30cc30a825c |
14 | 167571632a3 |
15 | b0752b3c71 |
hex | 62c03ce1bf |
424132010431 has 4 divisors (see below), whose sum is σ = 438757252200. Its totient is φ = 409506768664.
The previous prime is 424132010417. The next prime is 424132010479. The reversal of 424132010431 is 134010231424.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-424132010431 is a prime.
It is a super-2 number, since 2×4241320104312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 424132010396 and 424132010405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (424132011431) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7312620841 + ... + 7312620898.
It is an arithmetic number, because the mean of its divisors is an integer number (109689313050).
Almost surely, 2424132010431 is an apocalyptic number.
424132010431 is a deficient number, since it is larger than the sum of its proper divisors (14625241769).
424132010431 is a wasteful number, since it uses less digits than its factorization.
424132010431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14625241768.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 424132010431 its reverse (134010231424), we get a palindrome (558142241855).
The spelling of 424132010431 in words is "four hundred twenty-four billion, one hundred thirty-two million, ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •