Base | Representation |
---|---|
bin | 111011110110111000010… |
… | …110111110011110111001 |
3 | 112120020100022000111022121 |
4 | 323312320112332132321 |
5 | 1014343143420424423 |
6 | 12425354214521241 |
7 | 603116211224404 |
oct | 73667026763671 |
9 | 15506308014277 |
10 | 4113376733113 |
11 | 1346522a262aa |
12 | 565249666221 |
13 | 23ab74a6306b |
14 | 103134b94d3b |
15 | 71ee976145d |
hex | 3bdb85be7b9 |
4113376733113 has 8 divisors (see below), whose sum is σ = 4173036386400. Its totient is φ = 4053806594208.
The previous prime is 4113376733107. The next prime is 4113376733173. The reversal of 4113376733113 is 3113376733114.
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-4113376733113 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4113376733113.
It is not an unprimeable number, because it can be changed into a prime (4113376733173) 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, 22286023 + ... + 22469836.
It is an arithmetic number, because the mean of its divisors is an integer number (521629548300).
Almost surely, 24113376733113 is an apocalyptic number.
It is an amenable number.
4113376733113 is a deficient number, since it is larger than the sum of its proper divisors (59659653287).
4113376733113 is a wasteful number, since it uses less digits than its factorization.
4113376733113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44757191.
The product of its digits is 285768, while the sum is 43.
Subtracting from 4113376733113 its reverse (3113376733114), we obtain a palindrome (999999999999).
The spelling of 4113376733113 in words is "four trillion, one hundred thirteen billion, three hundred seventy-six million, seven hundred thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •