Base | Representation |
---|---|
bin | 11110101111111010101… |
… | …010010101001111110101 |
3 | 21111000002222220102222112 |
4 | 132233322222111033311 |
5 | 234104443242442123 |
6 | 4254414203140405 |
7 | 305442650366540 |
oct | 36577252251765 |
9 | 7430088812875 |
10 | 2113034343413 |
11 | 745150889024 |
12 | 2a162ab14705 |
13 | 1243485ab746 |
14 | 743b2a59857 |
15 | 39e7169ed78 |
hex | 1ebfaa953f5 |
2113034343413 has 8 divisors (see below), whose sum is σ = 2438806258560. Its totient is φ = 1793239894800.
The previous prime is 2113034343389. The next prime is 2113034343439. The reversal of 2113034343413 is 3143434303112.
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 2113034343413 - 28 = 2113034343157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2113034343413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2113034343443) 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, 1494365873 + ... + 1494367286.
It is an arithmetic number, because the mean of its divisors is an integer number (304850782320).
Almost surely, 22113034343413 is an apocalyptic number.
It is an amenable number.
2113034343413 is a deficient number, since it is larger than the sum of its proper divisors (325771915147).
2113034343413 is a wasteful number, since it uses less digits than its factorization.
2113034343413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2988733267.
The product of its (nonzero) digits is 31104, while the sum is 32.
Adding to 2113034343413 its reverse (3143434303112), we get a palindrome (5256468646525).
The spelling of 2113034343413 in words is "two trillion, one hundred thirteen billion, thirty-four million, three hundred forty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •