Base | Representation |
---|---|
bin | 100011011000011010110… |
… | …100010111011000011101 |
3 | 22121102212112201212012220 |
4 | 203120122310113120131 |
5 | 304314002231040123 |
6 | 5100545334415553 |
7 | 340443252052263 |
oct | 43303264273035 |
9 | 8542775655186 |
10 | 2431401424413 |
11 | 858173799105 |
12 | 33327b5015b9 |
13 | 1483846c4700 |
14 | 85975260433 |
15 | 433a6576ce3 |
hex | 2361ad1761d |
2431401424413 has 12 divisors (see below), whose sum is σ = 3510425725920. Its totient is φ = 1496247030096.
The previous prime is 2431401424409. The next prime is 2431401424477. The reversal of 2431401424413 is 3144241041342.
It is a happy number.
2431401424413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2431401424413 - 22 = 2431401424409 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2431401428413) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2397831273 + ... + 2397832286.
It is an arithmetic number, because the mean of its divisors is an integer number (292535477160).
Almost surely, 22431401424413 is an apocalyptic number.
It is an amenable number.
2431401424413 is a deficient number, since it is larger than the sum of its proper divisors (1079024301507).
2431401424413 is a wasteful number, since it uses less digits than its factorization.
2431401424413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4795663588 (or 4795663575 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 33.
Adding to 2431401424413 its reverse (3144241041342), we get a palindrome (5575642465755).
The spelling of 2431401424413 in words is "two trillion, four hundred thirty-one billion, four hundred one million, four hundred twenty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •