Base | Representation |
---|---|
bin | 11110110000011111011… |
… | …100010000010111111111 |
3 | 21111001201000000200210112 |
4 | 132300133130100113333 |
5 | 234112224230113211 |
6 | 4254555325100235 |
7 | 305464152361001 |
oct | 36603734202777 |
9 | 7431630020715 |
10 | 2113651410431 |
11 | 745438133670 |
12 | 2a17816b767b |
13 | 1244163a1762 |
14 | 744309a6371 |
15 | 39eaa93e88b |
hex | 1ec1f7105ff |
2113651410431 has 8 divisors (see below), whose sum is σ = 2306892809424. Its totient is φ = 1920591889920.
The previous prime is 2113651410383. The next prime is 2113651410433. The reversal of 2113651410431 is 1340141563112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-2113651410431 is a prime.
It is a super-4 number, since 4×21136514104314 (a number of 50 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2113651410433) 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, 45445316 + ... + 45491801.
It is an arithmetic number, because the mean of its divisors is an integer number (288361601178).
Almost surely, 22113651410431 is an apocalyptic number.
2113651410431 is a deficient number, since it is larger than the sum of its proper divisors (193241398993).
2113651410431 is a wasteful number, since it uses less digits than its factorization.
2113651410431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90939241.
The product of its (nonzero) digits is 8640, while the sum is 32.
Adding to 2113651410431 its reverse (1340141563112), we get a palindrome (3453792973543).
The spelling of 2113651410431 in words is "two trillion, one hundred thirteen billion, six hundred fifty-one million, four hundred ten thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •