Base | Representation |
---|---|
bin | 100100101000000111… |
… | …1001011100001000000 |
3 | 21112000122022211220211 |
4 | 1021100033023201000 |
5 | 2242041311133221 |
6 | 100044525443504 |
7 | 5453105203411 |
oct | 1112017134100 |
9 | 245018284824 |
10 | 78655567936 |
11 | 303a3021400 |
12 | 132b1710594 |
13 | 7556740b9a |
14 | 3b423ad808 |
15 | 20a54536e1 |
hex | 12503cb840 |
78655567936 has 63 divisors (see below), whose sum is σ = 171615211887. Its totient is φ = 35741312640.
The previous prime is 78655567919. The next prime is 78655567937. The reversal of 78655567936 is 63976555687.
The square root of 78655567936 is 280456.
It is a perfect power (a square), and thus also a powerful number.
It is a super-2 number, since 2×786555679362 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (78655567937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 24678535 + ... + 24681721.
Almost surely, 278655567936 is an apocalyptic number.
78655567936 is the 280456-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 78655567936
78655567936 is an abundant number, since it is smaller than the sum of its proper divisors (92959643951).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
78655567936 is an frugal number, since it uses more digits than its factorization.
78655567936 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6408 (or 3200 counting only the distinct ones).
The product of its digits is 285768000, while the sum is 67.
The spelling of 78655567936 in words is "seventy-eight billion, six hundred fifty-five million, five hundred sixty-seven thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •