Base | Representation |
---|---|
bin | 11001110010100000111110… |
… | …010010100011100000110101 |
3 | 112212121002101221000101222201 |
4 | 121302200332102203200311 |
5 | 104331303331044413323 |
6 | 1041121332440024501 |
7 | 32614336211454406 |
oct | 3162407622434065 |
9 | 485532357011881 |
10 | 113422541404213 |
11 | 3315a258780948 |
12 | 1087a06b762131 |
13 | 4b399134b24a2 |
14 | 2001974a2d9ad |
15 | d1a5a97748ad |
hex | 67283e4a3835 |
113422541404213 has 8 divisors (see below), whose sum is σ = 120551295924800. Its totient is φ = 106409701591488.
The previous prime is 113422541404153. The next prime is 113422541404253. The reversal of 113422541404213 is 312404145224311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113422541404213 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 (113422541404253) 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, 28978674948 + ... + 28978678861.
It is an arithmetic number, because the mean of its divisors is an integer number (15068911990600).
Almost surely, 2113422541404213 is an apocalyptic number.
It is an amenable number.
113422541404213 is a deficient number, since it is larger than the sum of its proper divisors (7128754520587).
113422541404213 is a wasteful number, since it uses less digits than its factorization.
113422541404213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57957353931.
The product of its (nonzero) digits is 92160, while the sum is 37.
Adding to 113422541404213 its reverse (312404145224311), we get a palindrome (425826686628524).
The spelling of 113422541404213 in words is "one hundred thirteen trillion, four hundred twenty-two billion, five hundred forty-one million, four hundred four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •