Base | Representation |
---|---|
bin | 11101100100011011101110… |
… | …10010100111101101110001 |
3 | 22112020012001022002121111011 |
4 | 32302031313102213231301 |
5 | 32010321122340422423 |
6 | 350143215542550521 |
7 | 16460536140230233 |
oct | 1662156722475561 |
9 | 275205038077434 |
10 | 65023511264113 |
11 | 1979a352a49356 |
12 | 7361baa438441 |
13 | 2a388c98cba4c |
14 | 120b224856253 |
15 | 77b626424b0d |
hex | 3b23774a7b71 |
65023511264113 has 8 divisors (see below), whose sum is σ = 67129949665280. Its totient is φ = 62917629474240.
The previous prime is 65023511264087. The next prime is 65023511264119. The reversal of 65023511264113 is 31146211532056.
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 65023511264113 - 225 = 65023477709681 is a prime.
It is a super-2 number, since 2×650235112641132 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (65023511264119) 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, 138915393 + ... + 139382686.
It is an arithmetic number, because the mean of its divisors is an integer number (8391243708160).
Almost surely, 265023511264113 is an apocalyptic number.
It is an amenable number.
65023511264113 is a deficient number, since it is larger than the sum of its proper divisors (2106438401167).
65023511264113 is a wasteful number, since it uses less digits than its factorization.
65023511264113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278305647.
The product of its (nonzero) digits is 129600, while the sum is 40.
Adding to 65023511264113 its reverse (31146211532056), we get a palindrome (96169722796169).
The spelling of 65023511264113 in words is "sixty-five trillion, twenty-three billion, five hundred eleven million, two hundred sixty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •