Base | Representation |
---|---|
bin | 100011011000011100000… |
… | …011000011111001111101 |
3 | 22121102220222112221201011 |
4 | 203120130003003321331 |
5 | 304314023021212023 |
6 | 5100551352515221 |
7 | 340443622313011 |
oct | 43303403037175 |
9 | 8542828487634 |
10 | 2431422054013 |
11 | 8581843a9467 |
12 | 3332863abb11 |
13 | 148388a68584 |
14 | 85977cb0541 |
15 | 433a829e50d |
hex | 2361c0c3e7d |
2431422054013 has 8 divisors (see below), whose sum is σ = 2444258868480. Its totient is φ = 2418590235600.
The previous prime is 2431422053993. The next prime is 2431422054049. The reversal of 2431422054013 is 3104502241342.
2431422054013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2431422054013 - 225 = 2431388499581 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2431422024013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 271093 + ... + 2221786.
It is an arithmetic number, because the mean of its divisors is an integer number (305532358560).
Almost surely, 22431422054013 is an apocalyptic number.
It is an amenable number.
2431422054013 is a deficient number, since it is larger than the sum of its proper divisors (12836814467).
2431422054013 is a wasteful number, since it uses less digits than its factorization.
2431422054013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2498027.
The product of its (nonzero) digits is 23040, while the sum is 31.
Adding to 2431422054013 its reverse (3104502241342), we get a palindrome (5535924295355).
The spelling of 2431422054013 in words is "two trillion, four hundred thirty-one billion, four hundred twenty-two million, fifty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •