Base | Representation |
---|---|
bin | 11110110000100110011… |
… | …111010101100000000011 |
3 | 21111002000020112022110212 |
4 | 132300212133111200003 |
5 | 234113000013031441 |
6 | 4255015151344335 |
7 | 305500116434120 |
oct | 36604637254003 |
9 | 7432006468425 |
10 | 2113769658371 |
11 | 745498959038 |
12 | 2a17b52220ab |
13 | 124434a34057 |
14 | 74442587747 |
15 | 39eb5eeaeeb |
hex | 1ec267d5803 |
2113769658371 has 8 divisors (see below), whose sum is σ = 2415843961344. Its totient is φ = 1811722157640.
The previous prime is 2113769658367. The next prime is 2113769658389. The reversal of 2113769658371 is 1738569673112.
It is a happy number.
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 2113769658371 - 22 = 2113769658367 is a prime.
It is a super-3 number, since 3×21137696583713 (a number of 38 digits) contains 333 as substring.
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 2113769658371.
It is not an unprimeable number, because it can be changed into a prime (2113769618371) 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, 6531275 + ... + 6847268.
It is an arithmetic number, because the mean of its divisors is an integer number (301980495168).
Almost surely, 22113769658371 is an apocalyptic number.
2113769658371 is a deficient number, since it is larger than the sum of its proper divisors (302074302973).
2113769658371 is a wasteful number, since it uses less digits than its factorization.
2113769658371 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13401121.
The product of its digits is 11430720, while the sum is 59.
The spelling of 2113769658371 in words is "two trillion, one hundred thirteen billion, seven hundred sixty-nine million, six hundred fifty-eight thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •