Base | Representation |
---|---|
bin | 11101110010010100001110… |
… | …01110100100010000000100 |
3 | 22120220210021212012102122212 |
4 | 32321022013032210100010 |
5 | 32041130031110203120 |
6 | 351150305023442552 |
7 | 16540153642521524 |
oct | 1671120716442004 |
9 | 276823255172585 |
10 | 65500520006660 |
11 | 19963683a48832 |
12 | 741a533756458 |
13 | 2a7189872ba6b |
14 | 12263563c5684 |
15 | 788c438c36c5 |
hex | 3b92873a4404 |
65500520006660 has 48 divisors (see below), whose sum is σ = 137938517907120. Its totient is φ = 26126454681600.
The previous prime is 65500520006657. The next prime is 65500520006671. The reversal of 65500520006660 is 6660002500556.
It can be written as a sum of positive squares in 8 ways, for example, as 11993518743556 + 53507001263104 = 3463166^2 + 7314848^2 .
It is a super-2 number, since 2×655005200066602 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23620712 + ... + 26247648.
It is an arithmetic number, because the mean of its divisors is an integer number (2873719123065).
Almost surely, 265500520006660 is an apocalyptic number.
It is an amenable number.
65500520006660 is an abundant number, since it is smaller than the sum of its proper divisors (72437997900460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
65500520006660 is a wasteful number, since it uses less digits than its factorization.
65500520006660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2630456 (or 2630454 counting only the distinct ones).
The product of its (nonzero) digits is 324000, while the sum is 41.
The spelling of 65500520006660 in words is "sixty-five trillion, five hundred billion, five hundred twenty million, six thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.921 sec. • engine limits •